{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s275881238", "group_id": "codeNet:p02572", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j])\n        if sum > modulo * 100 then sum = sum - modulo * 100 end\n        if sum > modulo * 10 then sum = sum - modulo * 10 end\n        if sum > modulo then sum = sum - modulo end\n    end\nend\n\nsum = sum % modulo\nprint(string.format(\"%d\", sum))", "language": "Lua", "metadata": {"date": 1600697119, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s275881238.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275881238", "user_id": "u185917698"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j])\n        if sum > modulo * 100 then sum = sum - modulo * 100 end\n        if sum > modulo * 10 then sum = sum - modulo * 10 end\n        if sum > modulo then sum = sum - modulo end\n    end\nend\n\nsum = sum % modulo\nprint(string.format(\"%d\", sum))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 517, "cpu_time_ms": 2205, "memory_kb": 6588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s174994324", "group_id": "codeNet:p02572", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j]) % modulo\n    end\nend\nprint(string.format(\"%d\", sum))", "language": "Lua", "metadata": {"date": 1598953149, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s174994324.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s174994324", "user_id": "u185917698"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j]) % modulo\n    end\nend\nprint(string.format(\"%d\", sum))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 328, "cpu_time_ms": 2205, "memory_kb": 6668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s918007787", "group_id": "codeNet:p02572", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j]) % modulo\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1598952988, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s918007787.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s918007787", "user_id": "u185917698"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\nlocal modulo = 10^9 + 7\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = (sum + list[i] * list[j]) % modulo\n    end\nend\nprint(sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 2205, "memory_kb": 6576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s504444515", "group_id": "codeNet:p02572", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = sum + list[i] * list[j]\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1598952702, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s504444515.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504444515", "user_id": "u185917698"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_c\n\nlocal n = tonumber(io.read())\n\nlocal list = {}\nfor i = 1, n do\n    list[i] = io.read(\"n\")\nend\n\nlocal sum = 0\n\nfor i = 1, n do\n    for j = i + 1, n do\n        sum = sum + list[i] * list[j]\n    end\nend\nprint(sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 6572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s933443194", "group_id": "codeNet:p02572", "input_text": "local n=io.read(\"n\")\nlocal mod=1000000007\nlocal a={}\nlocal b={[0]=0}\nfor i=1,n do\n    a[i]=io.read(\"n\")%mod\n    b[i]=(b[i-1]+a[i])%mod\nend\n\nlocal total=0\nfor i=1,n-1 do\n    total=total+a[i]*(b[n]-b[i])%mod\nend\nprint(total%mod)", "language": "Lua", "metadata": {"date": 1598736732, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s933443194.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933443194", "user_id": "u045238009"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal mod=1000000007\nlocal a={}\nlocal b={[0]=0}\nfor i=1,n do\n    a[i]=io.read(\"n\")%mod\n    b[i]=(b[i-1]+a[i])%mod\nend\n\nlocal total=0\nfor i=1,n-1 do\n    total=total+a[i]*(b[n]-b[i])%mod\nend\nprint(total%mod)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 85, "memory_kb": 10548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s521955364", "group_id": "codeNet:p02572", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal b={[0]=0}\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    b[i]=b[i-1]+a[i]\nend\n\nlocal mod=1000000007\nlocal total=0\nfor i=1,n-1 do\n    total=total+a[i]*(b[n]-b[i])%mod\nend\nprint(total%mod)", "language": "Lua", "metadata": {"date": 1598736618, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s521955364.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s521955364", "user_id": "u045238009"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal b={[0]=0}\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    b[i]=b[i-1]+a[i]\nend\n\nlocal mod=1000000007\nlocal total=0\nfor i=1,n-1 do\n    total=total+a[i]*(b[n]-b[i])%mod\nend\nprint(total%mod)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 76, "memory_kb": 10588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s575278988", "group_id": "codeNet:p02572", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\nlocal a = {}\nfor i = 1, n do\n\ta[i] = read(\"n\")\nend\n\nlocal mod_num = 1000000007\n\nlocal back_sum_t = {}\nback_sum_t[n + 1] = 0\nfor i = n, 2, -1 do\n\tback_sum_t[i] = (a[i] + back_sum_t[i + 1]) % mod_num\nend\nlocal out = 0\nfor i = 1, n - 1 do\n\tout = (out + ((a[i] * back_sum_t[i + 1]) % mod_num)) % mod_num\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1598730639, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s575278988.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575278988", "user_id": "u793881115"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\nlocal a = {}\nfor i = 1, n do\n\ta[i] = read(\"n\")\nend\n\nlocal mod_num = 1000000007\n\nlocal back_sum_t = {}\nback_sum_t[n + 1] = 0\nfor i = n, 2, -1 do\n\tback_sum_t[i] = (a[i] + back_sum_t[i + 1]) % mod_num\nend\nlocal out = 0\nfor i = 1, n - 1 do\n\tout = (out + ((a[i] * back_sum_t[i + 1]) % mod_num)) % mod_num\nend\n\nprint(out)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 85, "memory_kb": 14628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s266183587", "group_id": "codeNet:p02572", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\nlocal a = {}\nfor i = 1, n do\n\ta[i] = read(\"n\")\nend\n\nlocal mod_num = 1000000007\nlocal out = 0\nfor i = 1, n - 1 do\n\tfor j = i + 1, n do\n\t\tlocal mul = (a[i] * a[j]) % mod_num\n\t\tout = (out + mul) % mod_num\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1598729282, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s266183587.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s266183587", "user_id": "u793881115"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\nlocal a = {}\nfor i = 1, n do\n\ta[i] = read(\"n\")\nend\n\nlocal mod_num = 1000000007\nlocal out = 0\nfor i = 1, n - 1 do\n\tfor j = i + 1, n do\n\t\tlocal mul = (a[i] * a[j]) % mod_num\n\t\tout = (out + mul) % mod_num\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 6584}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s840458337", "group_id": "codeNet:p02572", "input_text": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bmul(x, y) return (x * y) % mod end\nlocal n = io.read(\"*n\")\nlocal sum = 0\nlocal ret = 0\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  ret = badd(ret, bmul(a, sum))\n  sum = badd(sum, a)\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1598727891, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lua/s840458337.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840458337", "user_id": "u120582723"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "local mod = 1000000007\nlocal function badd(x, y) return (x + y) % mod end\nlocal function bmul(x, y) return (x * y) % mod end\nlocal n = io.read(\"*n\")\nlocal sum = 0\nlocal ret = 0\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  ret = badd(ret, bmul(a, sum))\n  sum = badd(sum, a)\nend\nprint(ret)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\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 \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 74, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s740578745", "group_id": "codeNet:p02574", "input_text": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,math.floor(1000000/i) do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=math.floor(A/t[A])\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1599677313, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s740578745.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740578745", "user_id": "u045238009"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={}\nfor i=1,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,math.floor(1000000/i) do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=math.floor(A/t[A])\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 669, "cpu_time_ms": 917, "memory_kb": 44932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s325701238", "group_id": "codeNet:p02574", "input_text": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,math.floor(1000000/i) do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=math.floor(A/t[A])\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1599677200, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s325701238.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s325701238", "user_id": "u045238009"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,math.floor(1000000/i) do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=math.floor(A/t[A])\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 910, "memory_kb": 44960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s834840357", "group_id": "codeNet:p02574", "input_text": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,1000000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=A//t[A]\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1599677072, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s834840357.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s834840357", "user_id": "u045238009"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={1}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,1000000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\tlocal T={}\n\twhile A>1 do\n\t\tif not T[t[A]] then \n\t\t\tT[t[A]]=true\n\t\tend\n\t\tA=A//t[A]\n\tend\n\tfor p in pairs(T) do\n\t\tif not s[p] then\n\t\t\ts[p]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 659, "cpu_time_ms": 2209, "memory_kb": 117072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s826548543", "group_id": "codeNet:p02574", "input_text": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,1000000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\twhile A>t[A] do\n\t\tif not s[t[A]] then \n\t\t\ts[t[A]]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\t\tA=A//t[A]\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1599632886, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s826548543.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s826548543", "user_id": "u045238009"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={}\nfor i=2,1000000 do\n\tif not t[i] then\n\t\tfor j=1,1000000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\twhile A>t[A] do\n\t\tif not s[t[A]] then \n\t\t\ts[t[A]]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\t\tA=A//t[A]\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 584, "cpu_time_ms": 966, "memory_kb": 51712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s814992711", "group_id": "codeNet:p02574", "input_text": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={}\nfor i=2,1000 do\n\tif not t[i] then\n\t\tfor j=1,1000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\twhile A>t[A] do\n\t\tif not s[t[A]] then \n\t\t\ts[t[A]]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\t\tA=A//t[A]\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1599632807, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s814992711.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s814992711", "user_id": "u045238009"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local function gcd(a,b)\n\treturn b>0 and gcd(b,a%b) or a\nend\n\n----------\n\nlocal n=io.read(\"n\")\nlocal a={io.read(\"n\")}\nfor i=2,n do\n\ta[i]=io.read(\"n\")\nend\n\nlocal t={}\nfor i=2,1000 do\n\tif not t[i] then\n\t\tfor j=1,1000//i do\n\t\t\tt[i*j]=i\n\t\tend\n\tend\nend\n\nlocal s={}\nlocal pw=true\nfor i=1,n do\n\tlocal A=a[i]\n\twhile A>t[A] do\n\t\tif not s[t[A]] then \n\t\t\ts[t[A]]=true\n\t\telse\n\t\t\tpw=false\n\t\tend\n\t\tA=A//t[A]\n\tend\nend\n\nif pw then\n\tprint(\"pairwise coprime\")\nelse\n\tlocal sw=a[1]\n\tfor i=2,n do\n\t\tsw=gcd(sw,a[i])\n\tend\n\tif sw==1 then\n\t\tprint(\"setwise coprime\")\n\telse\n\t\tprint(\"not coprime\")\n\tend\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 175, "memory_kb": 18888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s098620655", "group_id": "codeNet:p02574", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "language": "Lua", "metadata": {"date": 1598954197, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s098620655.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s098620655", "user_id": "u185917698"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s055564123", "group_id": "codeNet:p02574", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "language": "Lua", "metadata": {"date": 1598954144, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s055564123.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s055564123", "user_id": "u185917698"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s336554240", "group_id": "codeNet:p02574", "input_text": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal max = math.max()\nfunction getGCD(a, b)\n    local t, i, m = 1\n    m = max(a, b)\n    for i = 2, m do\n        if (a % i == 0) and (b % i == 0) then t = i end\n    end\n    return t\nend\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "language": "Lua", "metadata": {"date": 1598954099, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s336554240.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s336554240", "user_id": "u185917698"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "-- Atcoder https://atcoder.jp/contests/abc177/tasks/abc177_e\n\nlocal max = math.max()\nfunction getGCD(a, b)\n    local t, i, m = 1\n    m = max(a, b)\n    for i = 2, m do\n        if (a % i == 0) and (b % i == 0) then t = i end\n    end\n    return t\nend\n\nlocal a = math.random(1, 3)\nif a == 1 then\n    print('pairwise coprime')\nelseif a == 2 then\n    print('setwise coprime')\nelse\n    print('not coprime')\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s366119297", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal function main()\n\tlocal n = read(\"n\")\n\tlocal last_gcd = 0\n\tlocal a_t = {}\n\tlocal a_max = 0\n\n\tfor i = 1, n do\n\t\tlocal a_i = read(\"n\")\n\t\ta_t[i] = a_i\n\t\ta_max = max(a_max, a_i)\n\t\tlast_gcd = gcd(max(last_gcd, a_i), min(last_gcd, a_i))\n\tend\n\tif last_gcd ~= 1 then\n\t\tprint(\"not coprime\")\n\t\treturn\n\tend\n\n\tlocal num_t = {}\n\tfor i = 1, a_max do\n\t\tnum_t[i] = 0\n\tend\n\tfor i = 1, n do\n\t\tnum_t[a_t[i]] = num_t[a_t[i]] + 1\n\tend\n\n\t-- [2, a_iの最大値]の数を全探索(1は含まない)\n\tfor i = 2, a_max do\n\t\tlocal count = 0\n\t\t-- iの倍数の中にa_iが存在するとカウントアップ\n\t\tfor j = i, a_max, i do\n\t\t\tcount = count + num_t[j]\n\t\tend\n\t\t-- 1つより大きければ重複しているので\n\t\tif count > 1 then\n\t\t\tprint(\"setwise coprime\")\n\t\t\treturn\n\t\tend\n\tend\n\tprint(\"pairwise coprime\")\nend\n\nmain()", "language": "Lua", "metadata": {"date": 1598878994, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s366119297.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s366119297", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal function main()\n\tlocal n = read(\"n\")\n\tlocal last_gcd = 0\n\tlocal a_t = {}\n\tlocal a_max = 0\n\n\tfor i = 1, n do\n\t\tlocal a_i = read(\"n\")\n\t\ta_t[i] = a_i\n\t\ta_max = max(a_max, a_i)\n\t\tlast_gcd = gcd(max(last_gcd, a_i), min(last_gcd, a_i))\n\tend\n\tif last_gcd ~= 1 then\n\t\tprint(\"not coprime\")\n\t\treturn\n\tend\n\n\tlocal num_t = {}\n\tfor i = 1, a_max do\n\t\tnum_t[i] = 0\n\tend\n\tfor i = 1, n do\n\t\tnum_t[a_t[i]] = num_t[a_t[i]] + 1\n\tend\n\n\t-- [2, a_iの最大値]の数を全探索(1は含まない)\n\tfor i = 2, a_max do\n\t\tlocal count = 0\n\t\t-- iの倍数の中にa_iが存在するとカウントアップ\n\t\tfor j = i, a_max, i do\n\t\t\tcount = count + num_t[j]\n\t\tend\n\t\t-- 1つより大きければ重複しているので\n\t\tif count > 1 then\n\t\t\tprint(\"setwise coprime\")\n\t\t\treturn\n\t\tend\n\tend\n\tprint(\"pairwise coprime\")\nend\n\nmain()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 964, "cpu_time_ms": 649, "memory_kb": 35244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s562477205", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal max_n = 1000003\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal function main()\n\tlocal n = read(\"n\")\n\tlocal num_t = {}\n\tfor i = 1, max_n do\n\t\tnum_t[i] = 0\n\tend\n\tlocal z = 0\n\tfor i = 1, n do\n\t\tlocal x = read(\"n\")\n\t\tnum_t[x] = num_t[x] + 1\n\t\tz = gcd(max(z, x), min(z, x))\n\tend\n\tif z ~= 1 then\n\t\tprint(\"not coprime\")\n\t\treturn\n\tend\n\n\tfor i = 2, max_n do\n\t\tlocal cnt = 0\n\t\tfor j = i, max_n, i do\n\t\t\tcnt = cnt + num_t[j]\n\t\tend\n\t\tif cnt > 1 then\n\t\t\tprint(\"setwise coprime\")\n\t\t\treturn\n\t\tend\n\tend\n\tprint(\"pairwise coprime\")\nend\n\nmain()", "language": "Lua", "metadata": {"date": 1598877459, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s562477205.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s562477205", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal max_n = 1000003\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal function main()\n\tlocal n = read(\"n\")\n\tlocal num_t = {}\n\tfor i = 1, max_n do\n\t\tnum_t[i] = 0\n\tend\n\tlocal z = 0\n\tfor i = 1, n do\n\t\tlocal x = read(\"n\")\n\t\tnum_t[x] = num_t[x] + 1\n\t\tz = gcd(max(z, x), min(z, x))\n\tend\n\tif z ~= 1 then\n\t\tprint(\"not coprime\")\n\t\treturn\n\tend\n\n\tfor i = 2, max_n do\n\t\tlocal cnt = 0\n\t\tfor j = i, max_n, i do\n\t\t\tcnt = cnt + num_t[j]\n\t\tend\n\t\tif cnt > 1 then\n\t\t\tprint(\"setwise coprime\")\n\t\t\treturn\n\t\tend\n\tend\n\tprint(\"pairwise coprime\")\nend\n\nmain()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 647, "cpu_time_ms": 642, "memory_kb": 18880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s037214181", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] and divided ~= 1 then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "language": "Lua", "metadata": {"date": 1598872670, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s037214181.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037214181", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] and divided ~= 1 then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1384, "cpu_time_ms": 641, "memory_kb": 76984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s409739779", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "language": "Lua", "metadata": {"date": 1598872209, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s409739779.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409739779", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1367, "cpu_time_ms": 529, "memory_kb": 51636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s521503427", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\ta_i_prime_t[divided] = true\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "language": "Lua", "metadata": {"date": 1598871988, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s521503427.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s521503427", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\tend\nend\n\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\ta_i_prime_t[divided] = true\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nprint(is_pairwise_coprime and \"pairwise coprime\" or (is_setwise_coprime and \"setwise coprime\" or \"not coprime\"))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1398, "cpu_time_ms": 540, "memory_kb": 51676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s949462607", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\ta_i_prime_t[divided] = true\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598871175, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s949462607.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s949462607", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\nlocal insert = table.insert\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\tlocal a_i_prime_t = {}\n\twhile true do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tinsert(a_i_prime_t, dust_t[divided])\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\ta_i_prime_t[divided] = true\n\t\t\tinsert(a_i_prime_t, divided)\n\t\t\tbreak\n\t\tend\n\tend\n\tfor j = 1, #a_i_prime_t do\n\t\tprime_factor_t[a_i_prime_t[j]] = true\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1427, "cpu_time_ms": 529, "memory_kb": 51676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s066218174", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598869852, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s066218174.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s066218174", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t[j] == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1245, "cpu_time_ms": 558, "memory_kb": 51676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s540521993", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598869803, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s540521993.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s540521993", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tif dust_t == nil then\n\t\t\t\tdust_t[j] = i\n\t\t\tend\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1242, "cpu_time_ms": 632, "memory_kb": 51572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s540935331", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tdust_t[j] = i\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598828018, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s540935331.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s540935331", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tdust_t[j] = i\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1209, "cpu_time_ms": 478, "memory_kb": 51564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s935056809", "group_id": "codeNet:p02574", "input_text": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tdust_t[j] = i\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tprint(divided)\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598827895, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s935056809.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s935056809", "user_id": "u793881115"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local read = io.read\nlocal max = math.max\nlocal min = math.min\n\nlocal n = read(\"n\")\n\nlocal a_max = 0\nlocal a_t = {}\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\ta_t[i] = a_i\n\ta_max = max(a_i, a_max)\nend\n\nlocal dust_t = {}\nfor i = 2, a_max do\n\tif dust_t[i] == nil then\n\t\tlocal j = 2 * i\n\t\twhile j <= a_max do\n\t\t\tdust_t[j] = i\n\t\t\tj = j + i\n\t\tend\n\tend\nend\n\nlocal is_pairwise_coprime = true\nlocal prime_factor_t = {}\nfor i = 1, n do\n\tlocal divided = a_t[i]\n\twhile divided ~= nil do\n\t\tif prime_factor_t[divided] then\n\t\t\tprint(divided)\n\t\t\tis_pairwise_coprime = false\n\t\t\tbreak\n\t\telseif dust_t[divided] then\n\t\t\tprime_factor_t[divided] = true\n\t\t\tdivided = divided // dust_t[divided]\n\t\telse\n\t\t\tprime_factor_t[divided] = true\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_pairwise_coprime then\n\t\tbreak\n\tend\nend\n\nif is_pairwise_coprime then\n\tprint(\"pairwise coprime\")\n\tos.exit()\nend\n\nlocal function gcd(x, y)\n\tif y == 0 then\n\t\treturn x\n\telse\n\t\treturn gcd(y, x % y)\n\tend\nend\n\nlocal is_setwise_coprime = false\nlocal pre_gcd_num = a_t[1]\nfor i = 2, n do\n\tpre_gcd_num = gcd(max(pre_gcd_num, a_t[i]), min(pre_gcd_num, a_t[i]))\n\tif pre_gcd_num == 1 then\n\t\tis_setwise_coprime = true\n\t\tbreak\n\tend\nend\n\nprint(is_setwise_coprime and \"setwise coprime\" or \"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1227, "cpu_time_ms": 482, "memory_kb": 51680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s283499909", "group_id": "codeNet:p02574", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal msq = math.sqrt\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(mce(msq(1000000)))\n\nlocal function getdivisorparts(x)\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 = mfl(x / dv)\n      while x % dv == 0 do\n        x = mfl(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\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal t = {}\nlocal test1 = false\nfor i = 1, n do\n  local dvp = getdivisorparts(a[i])\n  for j = 1, #dvp do\n    local k = dvp[j].p\n    if t[k] then\n      test1 = true break\n    else\n      t[k] = true\n    end\n  end\n  if test1 then break end\nend\nif not test1 then\n  print(\"pairwise coprime\")\n  os.exit()\nend\nlocal gcd = a[1]\n\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\n\nfor i = 2, n do\n  gcd = getgcd(gcd, a[i])\n  if gcd == 1 then\n    print(\"setwise coprime\") os.exit()\n  end\nend\nprint(\"not coprime\")\n", "language": "Lua", "metadata": {"date": 1598728524, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lua/s283499909.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s283499909", "user_id": "u120582723"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "local mfl, mce = math.floor, math.ceil\nlocal msq = math.sqrt\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(mce(msq(1000000)))\n\nlocal function getdivisorparts(x)\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 = mfl(x / dv)\n      while x % dv == 0 do\n        x = mfl(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\n\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal t = {}\nlocal test1 = false\nfor i = 1, n do\n  local dvp = getdivisorparts(a[i])\n  for j = 1, #dvp do\n    local k = dvp[j].p\n    if t[k] then\n      test1 = true break\n    else\n      t[k] = true\n    end\n  end\n  if test1 then break end\nend\nif not test1 then\n  print(\"pairwise coprime\")\n  os.exit()\nend\nlocal gcd = a[1]\n\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\n\nfor i = 2, n do\n  gcd = getgcd(gcd, a[i])\n  if gcd == 1 then\n    print(\"setwise coprime\") os.exit()\n  end\nend\nprint(\"not coprime\")\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 201, "memory_kb": 21020}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s575473529", "group_id": "codeNet:p02580", "input_text": "local h, w, m = io.read(\"*n\", \"*n\", \"*n\")\nlocal hlist = {}\nlocal hcnt = {}\nfor i = 1, h do\n  hlist[i] = {}\n  hcnt[i] = 0\nend\nlocal wcnt = {}\nfor i = 1, w do\n  wcnt[i] = 0\nend\nfor i = 1, m do\n  local hi, wi = io.read(\"*n\", \"*n\")\n  hlist[hi][wi] = true\n  hcnt[hi] = hcnt[hi] + 1\n  wcnt[wi] = wcnt[wi] + 1\nend\nlocal hmax, hmaxcnt = {}, 1\nfor i = 1, h do\n  if hcnt[i] == hmaxcnt then\n    table.insert(hmax, i)\n  elseif hmaxcnt < hcnt[i] then\n    for j = #hmax, 2, -1 do\n      hmax[j] = nil\n    end\n    hmax[1] = i\n    hmaxcnt = hcnt[i]\n  end\nend\nlocal wmax, wmaxcnt = {}, 1\nfor i = 1, w do\n  if wcnt[i] == wmaxcnt then\n    table.insert(wmax, i)\n  elseif wmaxcnt < wcnt[i] then\n    for j = #wmax, 2, -1 do\n      wmax[j] = nil\n    end\n    wmax[1] = i\n    wmaxcnt = wcnt[i]\n  end\nend\nlocal ret = hmaxcnt + wmaxcnt\nfor i = 1, #hmax do\n  for j = 1, #wmax do\n    if not hlist[hmax[i]][wmax[j]] then\n      print(ret) os.exit()\n    end\n  end\nend\nprint(ret - 1)\n", "language": "Lua", "metadata": {"date": 1598788782, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s575473529.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575473529", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local h, w, m = io.read(\"*n\", \"*n\", \"*n\")\nlocal hlist = {}\nlocal hcnt = {}\nfor i = 1, h do\n  hlist[i] = {}\n  hcnt[i] = 0\nend\nlocal wcnt = {}\nfor i = 1, w do\n  wcnt[i] = 0\nend\nfor i = 1, m do\n  local hi, wi = io.read(\"*n\", \"*n\")\n  hlist[hi][wi] = true\n  hcnt[hi] = hcnt[hi] + 1\n  wcnt[wi] = wcnt[wi] + 1\nend\nlocal hmax, hmaxcnt = {}, 1\nfor i = 1, h do\n  if hcnt[i] == hmaxcnt then\n    table.insert(hmax, i)\n  elseif hmaxcnt < hcnt[i] then\n    for j = #hmax, 2, -1 do\n      hmax[j] = nil\n    end\n    hmax[1] = i\n    hmaxcnt = hcnt[i]\n  end\nend\nlocal wmax, wmaxcnt = {}, 1\nfor i = 1, w do\n  if wcnt[i] == wmaxcnt then\n    table.insert(wmax, i)\n  elseif wmaxcnt < wcnt[i] then\n    for j = #wmax, 2, -1 do\n      wmax[j] = nil\n    end\n    wmax[1] = i\n    wmaxcnt = wcnt[i]\n  end\nend\nlocal ret = hmaxcnt + wmaxcnt\nfor i = 1, #hmax do\n  for j = 1, #wmax do\n    if not hlist[hmax[i]][wmax[j]] then\n      print(ret) os.exit()\n    end\n  end\nend\nprint(ret - 1)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 273, "memory_kb": 51424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s909309733", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,W) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,math.max(H,W) do\n    hmax=math.max(hmax,#bombh[i])\n    wmax=math.max(wmax,#bombw[i])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor i=1,math.max(H,W) do\n    if #bombh[i]==hmax then\n        table.insert(maxh,i)\n    end\n    if #bombw[i]==wmax then\n        table.insert(maxw,i)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598223516, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s909309733.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909309733", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,W) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,math.max(H,W) do\n    hmax=math.max(hmax,#bombh[i])\n    wmax=math.max(wmax,#bombw[i])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor i=1,math.max(H,W) do\n    if #bombh[i]==hmax then\n        table.insert(maxh,i)\n    end\n    if #bombw[i]==wmax then\n        table.insert(maxw,i)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 916, "memory_kb": 132456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s181214632", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,W) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,math.max(H,W) do\n    hmax=math.max(hmax,#bombh[i])\n    wmax=math.max(wmax,#bombw[i])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor h=1,#bombh do\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\nend\nfor w=1,#bombw do\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598223405, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s181214632.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181214632", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,W) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,math.max(H,W) do\n    hmax=math.max(hmax,#bombh[i])\n    wmax=math.max(wmax,#bombw[i])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor h=1,#bombh do\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\nend\nfor w=1,#bombw do\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 852, "cpu_time_ms": 675, "memory_kb": 93456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s947150508", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor h=1,#bombh do\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\nend\nfor w=1,#bombw do\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598223145, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s947150508.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s947150508", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor h=1,#bombh do\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\nend\nfor w=1,#bombw do\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 906, "cpu_time_ms": 724, "memory_kb": 116096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s610153996", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if not map[h] or (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598222184, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s610153996.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s610153996", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombh[h],w)\n    table.insert(bombw[w],h)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\nend\n\nlocal max=hmax+wmax-1\nlocal maxh={}\nlocal maxw={}\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if not map[h] or (map[h] and (not map[h][w])) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 933, "cpu_time_ms": 3311, "memory_kb": 116360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s996465897", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombw[w],h)\n    table.insert(bombh[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\n    max=math.max(max,#bombw[w]+#bombh[h]-1)\nend\n\nlocal maxh={}\nlocal maxw={}\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if map[h] and (not map[h][w]) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598221855, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s996465897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s996465897", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombh={}\nlocal bombw={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombh[i]={}\n    bombw[i]={}\n    map[i]={}\nend\n\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombw[w],h)\n    table.insert(bombh[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bombh[h])\n    wmax=math.max(wmax,#bombw[w])\n    max=math.max(max,#bombw[w]+#bombh[h]-1)\nend\n\nlocal maxh={}\nlocal maxw={}\nfor i=1,M do\n    local h=t[i][1]\n    local w=t[i][2]\n    if #bombh[h]==hmax then\n        table.insert(maxh,h)\n    end\n    if #bombw[w]==wmax then\n        table.insert(maxw,w)\n    end\nend\n\nfor i=1,#maxh do\n    local h=maxh[i]\n    for j=1,#maxw do\n        local w=maxw[j]\n        if map[h] and (not map[h][w]) then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 951, "cpu_time_ms": 3311, "memory_kb": 116364}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s463806711", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bomby[h])\n    wmax=math.max(wmax,#bombx[w])\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if #bombx[w]==wmax then\n        table.insert(maxx,w)\n    end\n    if #bomby[h]==hmax then\n        table.insert(maxy,h)\n    end\nend\n\nfor i=1,#maxy do\n    local h=bomby[i]\n    for j=1,#maxx do\n        local w=bombx[j]\n        if map[h] and not map[h][w] then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598221220, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s463806711.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s463806711", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bomby[h])\n    wmax=math.max(wmax,#bombx[w])\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if #bombx[w]==wmax then\n        table.insert(maxx,w)\n    end\n    if #bomby[h]==hmax then\n        table.insert(maxy,h)\n    end\nend\n\nfor i=1,#maxy do\n    local h=bomby[i]\n    for j=1,#maxx do\n        local w=bombx[j]\n        if map[h] and not map[h][w] then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3312, "memory_kb": 177380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s125881998", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bomby[h])\n    wmax=math.max(wmax,#bombx[w])\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if #bombx[w]==wmax then\n        table.insert(maxx,w)\n    end\n    if #bomby[h]==hmax then\n        table.insert(maxy,h)\n    end\nend\n\nfor i=1,#maxy do\n    local h=bomby[i]\n    for j=1,#maxx do\n        local w=bombx[j]\n        if map[h] and not map[h][w] then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598221203, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s125881998.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s125881998", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    hmax=math.max(hmax,#bomby[h])\n    wmax=math.max(wmax,#bombx[w])\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if #bombx[w]==wmax then\n        table.insert(maxx,w)\n    end\n    if #bomby[h]==hmax then\n        table.insert(maxy,h)\n    end\nend\n\nfor i=1,#maxy do\n    local h=bomby[i]\n    for j=1,#maxx do\n        local w=bombx[j]\n        if map[h] and not map[h][w] then\n            max=max+1\n            print(max)\n            return\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3311, "memory_kb": 116428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s661587544", "group_id": "codeNet:p02580", "input_text": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if hmax<#bomby[h] then\n        hmax=#bomby[h]\n        table.insert(maxy,h)\n    end\n    if wmax<#bombx[w] then\n        wmax=#bombx[w]\n        table.insert(maxx,w)\n    end\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nfor i=1,#maxy do\n    for j=1,#maxx do\n        if (not map[i]) or (map[i] and (not map[i][j])) then\n            max=max+1\n            break\n        end\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1598220529, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s661587544.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s661587544", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local H,W,M=io.read(\"n\",\"n\",\"n\")\nlocal bombx={}\nlocal bomby={}\nlocal map={}\nfor i=1,math.max(H,M) do\n    bombx[i]={}\n    bomby[i]={}\n    map[i]={}\nend\nlocal t={}\nfor i=1,M do\n    local h,w=io.read(\"n\",\"n\")\n    table.insert(bombx[w],h)\n    table.insert(bomby[h],w)\n    map[h][w]=true\n    t[i]={h,w}\nend\n\nlocal max=0\nlocal hmax=0\nlocal wmax=0\nlocal maxx={}\nlocal maxy={}\nfor i=1,M do\n    local w=t[i][2]\n    local h=t[i][1]\n    if hmax<#bomby[h] then\n        hmax=#bomby[h]\n        table.insert(maxy,h)\n    end\n    if wmax<#bombx[w] then\n        wmax=#bombx[w]\n        table.insert(maxx,w)\n    end\n    max=math.max(max,#bombx[w]+#bomby[h]-1)\nend\n\nfor i=1,#maxy do\n    for j=1,#maxx do\n        if (not map[i]) or (map[i] and (not map[i][j])) then\n            max=max+1\n            break\n        end\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 818, "cpu_time_ms": 693, "memory_kb": 107988}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s357417268", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_i_t, sum_w_i_t = {}, {}\nfor i = 1, m do\n\tlocal h_i = read(\"n\")\n\tlocal w_i = read(\"n\")\n\tgrid_t[h_i][w_i] = true\n\tsum_h_i_t[h_i] = sum_h_i_t[h_i] and sum_h_i_t[h_i] + 1 or 1\n\tsum_w_i_t[w_i] = sum_w_i_t[w_i] and sum_w_i_t[w_i] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_i_t[i] and sum_h_i_t[i] > max_h then\n\t\tmax_h = sum_h_i_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_i_t[i] and sum_h_i_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_i_t[i] and sum_w_i_t[i] > max_w then\n\t\tmax_w = sum_w_i_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_i_t[i] and sum_w_i_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598182502, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s357417268.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357417268", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_i_t, sum_w_i_t = {}, {}\nfor i = 1, m do\n\tlocal h_i = read(\"n\")\n\tlocal w_i = read(\"n\")\n\tgrid_t[h_i][w_i] = true\n\tsum_h_i_t[h_i] = sum_h_i_t[h_i] and sum_h_i_t[h_i] + 1 or 1\n\tsum_w_i_t[w_i] = sum_w_i_t[w_i] and sum_w_i_t[w_i] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_i_t[i] and sum_h_i_t[i] > max_h then\n\t\tmax_h = sum_h_i_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_i_t[i] and sum_h_i_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_i_t[i] and sum_w_i_t[i] > max_w then\n\t\tmax_w = sum_w_i_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_i_t[i] and sum_w_i_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1122, "cpu_time_ms": 354, "memory_kb": 51248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s003664345", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_i_t, sum_w_i_t = {}, {}\nfor i = 1, m do\n\tlocal h_i = read(\"n\")\n\tlocal w_i = read(\"n\")\n\tgrid_t[h_i][w_i] = true\n\tsum_h_i_t[h_i] = sum_h_i_t[h_i] and sum_h_i_t[h_i] + 1 or 1\n\tsum_w_i_t[w_i] = sum_w_i_t[w_i] and sum_w_i_t[w_i] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_i_t[i] and sum_h_i_t[i] > max_h then\n\t\tmax_h = sum_h_i_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_i_t[i] and sum_h_i_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_i_t[i] and sum_w_i_t[i] > max_w then\n\t\tmax_w = sum_w_i_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_i_t[i] and sum_w_i_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598182272, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s003664345.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s003664345", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_i_t, sum_w_i_t = {}, {}\nfor i = 1, m do\n\tlocal h_i = read(\"n\")\n\tlocal w_i = read(\"n\")\n\tgrid_t[h_i][w_i] = true\n\tsum_h_i_t[h_i] = sum_h_i_t[h_i] and sum_h_i_t[h_i] + 1 or 1\n\tsum_w_i_t[w_i] = sum_w_i_t[w_i] and sum_w_i_t[w_i] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_i_t[i] and sum_h_i_t[i] > max_h then\n\t\tmax_h = sum_h_i_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_i_t[i] and sum_h_i_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_i_t[i] and sum_w_i_t[i] > max_w then\n\t\tmax_w = sum_w_i_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_i_t[i] and sum_w_i_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1122, "cpu_time_ms": 545, "memory_kb": 75932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s289450549", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598182084, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s289450549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289450549", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, h do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, w do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1076, "cpu_time_ms": 552, "memory_kb": 76040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s294618426", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, w do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, h do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598181554, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s294618426.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s294618426", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t = {}, {}\nfor i = 1, w do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, h do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1076, "cpu_time_ms": 550, "memory_kb": 75960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s434168888", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t\nfor i = 1, w do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, h do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598180241, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s434168888.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s434168888", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid_t = {}\nfor i = 1, h do\n\tgrid_t[i] = {}\nend\n\nlocal sum_h_t, sum_w_t = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid_t[hs][ws] = true\n\tsum_h_t[hs] = sum_h_t[hs] and sum_h_t[hs] + 1 or 1\n\tsum_w_t[ws] = sum_w_t[ws] and sum_w_t[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_h_index_t, max_w_index_t\nfor i = 1, w do\n\tif sum_h_t[i] and sum_h_t[i] > max_h then\n\t\tmax_h = sum_h_t[i]\n\t\tmax_h_index_t = {i}\n\telseif sum_h_t[i] and sum_h_t[i] == max_h then\n\t\tinsert(max_h_index_t, i)\n\tend\nend\nfor i = 1, h do\n\tif sum_w_t[i] and sum_w_t[i] > max_w then\n\t\tmax_w = sum_w_t[i]\n\t\tmax_w_index_t = {i}\n\telseif sum_w_t[i] and sum_w_t[i] == max_w then\n\t\tinsert(max_w_index_t, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_h_index_t do\n\tfor j = 1, #max_w_index_t do\n\t\tif grid_t[max_h_index_t[i]][max_w_index_t[j]] == nil then\n\t\t\tis_dup = false\n\t\t\tbreak\n\t\tend\n\tend\n\tif not is_dup then\n\t\tbreak\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1067, "cpu_time_ms": 537, "memory_kb": 75980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s182583072", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid = {}\nfor i = 1, h do\n\tgrid[i] = {}\nend\n\nlocal sum_h, sum_w = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid[hs][ws] = true\n\tsum_h[hs] = sum_h[hs] and sum_h[hs] + 1 or 1\n\tsum_w[ws] = sum_w[ws] and sum_w[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_hs, max_ws\nfor i = 1, m do\n\tif sum_h[i] and sum_h[i] > max_h then\n\t\tmax_h = sum_h[i]\n\t\tmax_hs = {i}\n\telseif sum_h[i] and sum_h[i] == max_h then\n\t\tinsert(max_hs, i)\n\tend\n\tif sum_w[i] and sum_w[i] > max_w then\n\t\tmax_w = sum_w[i]\n\t\tmax_ws = {i}\n\telseif sum_w[i] and sum_w[i] == max_w then\n\t\tinsert(max_ws, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_hs do\n\tfor j = 1, #max_ws do\n\t\tif grid[max_hs[i]][max_ws[j]] == nil then\n\t\t\tis_dup = false\n\t\tend\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598179268, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s182583072.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s182583072", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid = {}\nfor i = 1, h do\n\tgrid[i] = {}\nend\n\nlocal sum_h, sum_w = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid[hs][ws] = true\n\tsum_h[hs] = sum_h[hs] and sum_h[hs] + 1 or 1\n\tsum_w[ws] = sum_w[ws] and sum_w[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_hs, max_ws\nfor i = 1, m do\n\tif sum_h[i] and sum_h[i] > max_h then\n\t\tmax_h = sum_h[i]\n\t\tmax_hs = {i}\n\telseif sum_h[i] and sum_h[i] == max_h then\n\t\tinsert(max_hs, i)\n\tend\n\tif sum_w[i] and sum_w[i] > max_w then\n\t\tmax_w = sum_w[i]\n\t\tmax_ws = {i}\n\telseif sum_w[i] and sum_w[i] == max_w then\n\t\tinsert(max_ws, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_hs do\n\tfor j = 1, #max_ws do\n\t\tif grid[max_hs[i]][max_ws[j]] == nil then\n\t\t\tis_dup = false\n\t\tend\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 3310, "memory_kb": 83212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s017454488", "group_id": "codeNet:p02580", "input_text": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid = {}\nfor i = 1, m do\n\tgrid[i] = {}\nend\n\nlocal sum_h, sum_w = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid[hs][ws] = 1\n\tsum_h[hs] = sum_h[hs] and sum_h[hs] + 1 or 1\n\tsum_w[ws] = sum_w[ws] and sum_w[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_hs, max_ws\nfor i = 1, m do\n\tif sum_h[i] and sum_h[i] > max_h then\n\t\tmax_h = sum_h[i]\n\t\tmax_hs = {i}\n\telseif sum_h[i] and sum_h[i] == max_h then\n\t\tinsert(max_hs, i)\n\tend\n\tif sum_w[i] and sum_w[i] > max_w then\n\t\tmax_w = sum_w[i]\n\t\tmax_ws = {i}\n\telseif sum_w[i] and sum_w[i] == max_w then\n\t\tinsert(max_ws, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_hs do\n\tfor j = 1, #max_ws do\n\t\tif grid[max_hs[i]][max_ws[j]] == nil then\n\t\t\tis_dup = false\n\t\tend\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "language": "Lua", "metadata": {"date": 1598178910, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s017454488.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s017454488", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\n\nlocal h, w, m = read(\"n\", \"n\", \"n\")\nlocal grid = {}\nfor i = 1, m do\n\tgrid[i] = {}\nend\n\nlocal sum_h, sum_w = {}, {}\nfor i = 1, m do\n\tlocal hs = read(\"n\")\n\tlocal ws = read(\"n\")\n\tgrid[hs][ws] = 1\n\tsum_h[hs] = sum_h[hs] and sum_h[hs] + 1 or 1\n\tsum_w[ws] = sum_w[ws] and sum_w[ws] + 1 or 1\nend\n\nlocal max_h, max_w = 0, 0\nlocal max_hs, max_ws\nfor i = 1, m do\n\tif sum_h[i] and sum_h[i] > max_h then\n\t\tmax_h = sum_h[i]\n\t\tmax_hs = {i}\n\telseif sum_h[i] and sum_h[i] == max_h then\n\t\tinsert(max_hs, i)\n\tend\n\tif sum_w[i] and sum_w[i] > max_w then\n\t\tmax_w = sum_w[i]\n\t\tmax_ws = {i}\n\telseif sum_w[i] and sum_w[i] == max_w then\n\t\tinsert(max_ws, i)\n\tend\nend\n\nlocal is_dup = true\nfor i = 1, #max_hs do\n\tfor j = 1, #max_ws do\n\t\tif grid[max_hs[i]][max_ws[j]] == nil then\n\t\t\tis_dup = false\n\t\tend\n\tend\nend\n\nprint(is_dup and max_h + max_w - 1 or max_h + max_w)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 888, "cpu_time_ms": 3310, "memory_kb": 83180}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s603787541", "group_id": "codeNet:p02580", "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 \"<too deep!>\" 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": 1598178225, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lua/s603787541.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603787541", "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(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 \"<too deep!>\" 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 : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1723, "memory_kb": 213232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s809207108", "group_id": "codeNet:p02612", "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 \"<too deep!>\" 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 = read.n()\nlocal r = N % 1000\nif r == 0 then\n    print(0)\nelse\n    print(1000 - r)\nend", "language": "Lua", "metadata": {"date": 1595812687, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s809207108.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s809207108", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100\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 \"<too deep!>\" 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 = read.n()\nlocal r = N % 1000\nif r == 0 then\n    print(0)\nelse\n    print(1000 - r)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2688, "cpu_time_ms": 9, "memory_kb": 2752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s947096572", "group_id": "codeNet:p02612", "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 \"<too deep!>\" 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 = read.n()\nlocal r = N % 1000\nprint(1000 - r)", "language": "Lua", "metadata": {"date": 1595812627, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s947096572.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s947096572", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100\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 \"<too deep!>\" 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 = read.n()\nlocal r = N % 1000\nprint(1000 - r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s920088711", "group_id": "codeNet:p02612", "input_text": "local n=io.read(\"n\")\nlocal senyen=0\nwhile n>senyen do\n    senyen=senyen+1000\nend\nprint(senyen-n)", "language": "Lua", "metadata": {"date": 1594006586, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s920088711.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s920088711", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal senyen=0\nwhile n>senyen do\n    senyen=senyen+1000\nend\nprint(senyen-n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 7, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s970342158", "group_id": "codeNet:p02612", "input_text": "local change = 1000 - io.read(\"*n\") % 1000\nif change == 1000 then\n\tchange = 0\nend\nprint(change)\n", "language": "Lua", "metadata": {"date": 1593997789, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s970342158.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970342158", "user_id": "u793881115"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "local change = 1000 - io.read(\"*n\") % 1000\nif change == 1000 then\n\tchange = 0\nend\nprint(change)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 7, "memory_kb": 2776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s365781135", "group_id": "codeNet:p02612", "input_text": "print(io.read(\"*n\") % 1000)\n", "language": "Lua", "metadata": {"date": 1593997659, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s365781135.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s365781135", "user_id": "u793881115"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "print(io.read(\"*n\") % 1000)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 28, "cpu_time_ms": 5, "memory_kb": 2776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s504652904", "group_id": "codeNet:p02612", "input_text": "function rl()\n   local r = {}\n   for word in io.read():gmatch(\"%S+\") do\n      table.insert(r, tonumber(word))\n   end\n   return r\nend\n\nfunction ru()\n   return unpack(rl())\nend\n\nfunction pu(x, ...)\n   if x then\n      io.write(x, ' ')\n      return pu(...)\n   else\n      io.write('\\n')\n   end\nend\n\nN = ru()\n\npu(math.fmod(1000000 - N, 1000))\n", "language": "Lua", "metadata": {"date": 1593997492, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s504652904.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s504652904", "user_id": "u677997743"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "function rl()\n   local r = {}\n   for word in io.read():gmatch(\"%S+\") do\n      table.insert(r, tonumber(word))\n   end\n   return r\nend\n\nfunction ru()\n   return unpack(rl())\nend\n\nfunction pu(x, ...)\n   if x then\n      io.write(x, ' ')\n      return pu(...)\n   else\n      io.write('\\n')\n   end\nend\n\nN = ru()\n\npu(math.fmod(1000000 - N, 1000))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 4, "memory_kb": 2572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s965216825", "group_id": "codeNet:p02612", "input_text": "a = io.read(\"*n\")\na = a % 1000\nif a == 0 then\n  print(0)\nelse\n  print(1000 - a)\nend\n", "language": "Lua", "metadata": {"date": 1593997243, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lua/s965216825.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965216825", "user_id": "u120582723"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "a = io.read(\"*n\")\na = a % 1000\nif a == 0 then\n  print(0)\nelse\n  print(1000 - a)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\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 amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s653039280", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\nlocal function tle()\n    return clock() > 1.97\nend\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    if not dryrun then\n        t[d] = newt\n    end\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nlocal function choose1dqupdate()\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,2000 do\n        if tle() then\n            break\n        end\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    return diffmax, maxd, maxq\nend\n---\nmath.randomseed(0)\nt = greedy()\nlocal ans = initial_evaluate(t)\nlocal MM = 190\nfor i=1,MM do\n    local diffmax, maxd, maxq = choose1dqupdate()\n    if diffmax > 0 then\n        io.stderr:write(\"!!\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n        diff_evaluate(maxd, maxq, false)\n    else\n        if math.random(100) > 1 - 90 * i / MM then\n            io.stderr:write(\"??\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n            diff_evaluate(maxd, maxq, false)\n        end\n    end\nend\nwhile true do\n    if tle() then\n        break\n    end\n    for i=1,200 do\n        local diffmax, maxd, maxq = choose1dqupdate()\n        if diffmax > 0 then\n            io.stderr:write(\"!!!\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n            diff_evaluate(maxd, maxq, false)\n        end\n    end\nend\n\nio.stderr:write(\"!!\"..\" \"..clock().. \"\\n\")\nfor d=1,D do\n    print(t[d])\nend\n", "language": "Lua", "metadata": {"date": 1593490640, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s653039280.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s653039280", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\nlocal function tle()\n    return clock() > 1.97\nend\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    if not dryrun then\n        t[d] = newt\n    end\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nlocal function choose1dqupdate()\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,2000 do\n        if tle() then\n            break\n        end\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    return diffmax, maxd, maxq\nend\n---\nmath.randomseed(0)\nt = greedy()\nlocal ans = initial_evaluate(t)\nlocal MM = 190\nfor i=1,MM do\n    local diffmax, maxd, maxq = choose1dqupdate()\n    if diffmax > 0 then\n        io.stderr:write(\"!!\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n        diff_evaluate(maxd, maxq, false)\n    else\n        if math.random(100) > 1 - 90 * i / MM then\n            io.stderr:write(\"??\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n            diff_evaluate(maxd, maxq, false)\n        end\n    end\nend\nwhile true do\n    if tle() then\n        break\n    end\n    for i=1,200 do\n        local diffmax, maxd, maxq = choose1dqupdate()\n        if diffmax > 0 then\n            io.stderr:write(\"!!!\".. \" \" .. i ..\" \"..diffmax.. \" \".. clock() ..\"\\n\")\n            diff_evaluate(maxd, maxq, false)\n        end\n    end\nend\n\nio.stderr:write(\"!!\"..\" \"..clock().. \"\\n\")\nfor d=1,D do\n    print(t[d])\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6460, "cpu_time_ms": 1985, "memory_kb": 3896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s021007489", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\nlocal function not_tle()\n    return clock() < 1.97\nend\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    if not dryrun then\n        t[d] = newt\n    end\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nt = greedy()\nmath.randomseed(0)\n--local M = 2500\nlocal ans = initial_evaluate(t)\nwhile not_tle() do\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,1000 do\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    if diffmax > 0 then\n        --print(\"!!\", diffmax)\n        diff_evaluate(maxd, maxq, false)\n    end\nend\n\nfor d=1,D do\n    print(t[d])\nend\n", "language": "Lua", "metadata": {"date": 1593405761, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s021007489.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021007489", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\nlocal function not_tle()\n    return clock() < 1.97\nend\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    if not dryrun then\n        t[d] = newt\n    end\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nt = greedy()\nmath.randomseed(0)\n--local M = 2500\nlocal ans = initial_evaluate(t)\nwhile not_tle() do\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,1000 do\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    if diffmax > 0 then\n        --print(\"!!\", diffmax)\n        diff_evaluate(maxd, maxq, false)\n    end\nend\n\nfor d=1,D do\n    print(t[d])\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5698, "cpu_time_ms": 1988, "memory_kb": 3840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s902246523", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    t[d] = newt\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nt = greedy()\nmath.randomseed(0)\n--local M = 2500\nlocal ans = initial_evaluate(t)\nwhile clock() < 1.97 do\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,1000 do\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    if diffmax > 0 then\n        --print(\"!!\", diffmax)\n        diff_evaluate(maxd, maxq, false)\n    end\nend\n\nfor d=1,D do\n    print(t[d])\nend\n", "language": "Lua", "metadata": {"date": 1593405118, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s902246523.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s902246523", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 clock = os.clock\n---\nlocal D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\nlocal function greedy()\n    local last = array(1, 0)\n    local t = {}\n    for d=1,D do\n        local amax = -10^18\n        local maxi = 1\n        for i=1,26 do\n            local ans = S[d][i]\n            for j=1,26 do\n                if j ~= i then\n                    ans = ans - C[j] * (d - last[j])\n                end\n            end\n            if ans > amax then\n                amax = ans\n                maxi = i\n            end\n        end\n        last[maxi] = d\n        t[d] = maxi\n    end\n    return t\nend\nlocal t\n-----\nlocal satisf_open = array(1, 0)\nlocal satisf_wait = array(2, 0)\nlocal last = array(2, 0)\nlocal function evaluate_satisfs()\n    -- 365 * 26 loops\n    local ans = 0\n    for d=1,D do\n        ans = ans + satisf_open[d]\n        for i=1,26 do\n            ans = ans + satisf_wait[d][i]\n        end\n    end\n    return ans\nend\nlocal function initial_evaluate(t)\n    -- 365 * 26 loops\n    for d=1,D do\n        for i=1,26 do\n            last[d][i] = last[d-1][i]\n        end\n        local i = t[d]\n        satisf_open[d] = S[d][i]\n\n        last[d][i] = d\n        for i=1,26 do\n            satisf_wait[d][i] = - C[i] * (d - last[d][i])\n        end\n    end\n    return evaluate_satisfs()\nend\n-----\nlocal function diff_evaluate(d, newt, dryrun)\n    local ansdiff = 0\n    -- 365*2 loops\n    -- for Day d\n    local oldt = t[d]\n    local ansdiff = S[d][newt] - satisf_open[d]\n    if not dryrun then\n        satisf_open[d] = S[d][newt]\n    end\n    t[d] = newt\n    -- for newt\n    local newlast_newt = d\n    for e=d,D do\n        local oldlast_newt = last[e][newt]\n        if last[e][newt] >= d then\n            break\n        else\n            local daydiff = newlast_newt - oldlast_newt\n            ansdiff = ansdiff + C[newt] * daydiff\n            if not dryrun then\n                last[e][newt] = d\n            end\n        end\n    end\n    -- for oldt\n    local oldlast_oldt = d\n    local newlast_oldt = 0\n    if d ~= 1 then\n        newlast_oldt = last[d-1][oldt]\n    end\n    for e=d,D do\n        local test_t = last[e][oldt]\n        if test_t > d then\n            break\n        else\n            local daydiff = newlast_oldt - oldlast_oldt\n            ansdiff = ansdiff + C[oldt] * daydiff\n            if not dryrun then\n                last[e][oldt] = newlast_oldt\n            end\n        end\n    end\n    return ansdiff\nend\n-----\nt = greedy()\nmath.randomseed(0)\n--local M = 2500\nlocal ans = initial_evaluate(t)\nwhile clock() < 1.97 do\n    local diffmax, maxd, maxq = -10^18, 1, 1\n    for j=1,1000 do\n        local d, q = math.random(1,D), math.random(1,26)\n        local diff = diff_evaluate(d, q, true)\n        if diff > diffmax then\n            diffmax = diff\n            maxd = d\n            maxq = q\n        end\n    end\n    if diffmax > 0 then\n        --print(\"!!\", diffmax)\n        diff_evaluate(maxd, maxq, false)\n    end\nend\n\nfor d=1,D do\n    print(t[d])\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5613, "cpu_time_ms": 1986, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s933951946", "group_id": "codeNet:p02618", "input_text": "for d=1,365 do\n  print((d % 26) + 1)\nend", "language": "Lua", "metadata": {"date": 1593400792, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s933951946.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933951946", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "for d=1,365 do\n  print((d % 26) + 1)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 2680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s909023961", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[52]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "language": "Lua", "metadata": {"date": 1593399538, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s909023961.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909023961", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[52]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 1947, "memory_kb": 35088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s621081519", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[53]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "language": "Lua", "metadata": {"date": 1593399235, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s621081519.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621081519", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[53]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 1962, "memory_kb": 35580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s749963235", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[51]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "language": "Lua", "metadata": {"date": 1593398923, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s749963235.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749963235", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[51]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 1827, "memory_kb": 34492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s981961369", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[6]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "language": "Lua", "metadata": {"date": 1593398617, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s981961369.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981961369", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\n--score,contestid,last\nlocal beam={{0,{},last}}\nfor i=1,D do\n\tlocal newbeam={}\n\tfor k,b in ipairs(beam) do\n\t\tlocal lastt={}\n\t\tfor j=1,26 do\n\t\t\tlastt[j]=copy(b[3])\n\t\tend\n\t\tfor j=1,26 do\n\t\t\tlocal t=copy(b[2])\n\t\t\ttable.insert(t,j)\n\t\t\ttable.insert(newbeam,{b[1]+calc(i,j,lastt[j]),t,lastt[j]})\n\t\tend\n\tend\n\ttable.sort(newbeam,function(a,b)return a[1]>b[1]end)\n\tnewbeam[6]=nil\n\tbeam=newbeam\nend\n\nfor i,v in ipairs(beam[1][2])do\nprint(v)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 879, "cpu_time_ms": 154, "memory_kb": 6084}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s359710111", "group_id": "codeNet:p02618", "input_text": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal ld = {}\nlocal function solveAll(t)\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    ld[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - ld[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\n\nlocal candidate = {}\nfor i = 1, 365 do\n  candidate[i] = {}\n  for j = 1, 26 do\n    if 1 + (i % 26) ~= j then\n      table.insert(candidate[i], j)\n    end\n  end\nend\nlocal day_candidate = {}\nfor i = 1, 365 do day_candidate[i] = i end\n\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  if #day_candidate == 0 then\n    -- reset\n    for i = 1, 365 do\n      day_candidate[i] = i\n      candidate[i] = {}\n      for j = 1, 26 do\n        if t[i] ~= j then\n          table.insert(candidate[i], j)\n        end\n      end\n    end\n  end\n  local changeday_idx = 1 + (iter % #day_candidate)--random(1, #day_candidate)\n  local changeday = day_candidate[changeday_idx]\n  local changeto_idx = random(1, #candidate[changeday])\n  local changeto = candidate[changeday][changeto_idx]\n  table.remove(candidate[changeday], changeto_idx)\n  if #candidate[changeday] == 0 then\n    table.remove(day_candidate, changeday_idx)\n  end\n  local changefrom = t[changeday]\n  -- if changefrom <= changeto then\n  --   changeto = changeto + 1\n  -- end\n  local score_before_p1 = scores[changefrom]\n  local score_before_p2 = scores[changeto]\n  local penalty_before_p1 = penalties[changefrom]\n  local penalty_before_p2 = penalties[changeto]\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n    iter = iter + 1\n  else\n    scores[changefrom] = score_before_p1\n    scores[changeto] = score_before_p2\n    penalties[changefrom] = penalty_before_p1\n    penalties[changeto] = penalty_before_p2\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1593397835, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s359710111.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359710111", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal ld = {}\nlocal function solveAll(t)\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    ld[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - ld[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\n\nlocal candidate = {}\nfor i = 1, 365 do\n  candidate[i] = {}\n  for j = 1, 26 do\n    if 1 + (i % 26) ~= j then\n      table.insert(candidate[i], j)\n    end\n  end\nend\nlocal day_candidate = {}\nfor i = 1, 365 do day_candidate[i] = i end\n\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  if #day_candidate == 0 then\n    -- reset\n    for i = 1, 365 do\n      day_candidate[i] = i\n      candidate[i] = {}\n      for j = 1, 26 do\n        if t[i] ~= j then\n          table.insert(candidate[i], j)\n        end\n      end\n    end\n  end\n  local changeday_idx = 1 + (iter % #day_candidate)--random(1, #day_candidate)\n  local changeday = day_candidate[changeday_idx]\n  local changeto_idx = random(1, #candidate[changeday])\n  local changeto = candidate[changeday][changeto_idx]\n  table.remove(candidate[changeday], changeto_idx)\n  if #candidate[changeday] == 0 then\n    table.remove(day_candidate, changeday_idx)\n  end\n  local changefrom = t[changeday]\n  -- if changefrom <= changeto then\n  --   changeto = changeto + 1\n  -- end\n  local score_before_p1 = scores[changefrom]\n  local score_before_p2 = scores[changeto]\n  local penalty_before_p1 = penalties[changefrom]\n  local penalty_before_p2 = penalties[changeto]\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n    iter = iter + 1\n  else\n    scores[changefrom] = score_before_p1\n    scores[changeto] = score_before_p2\n    penalties[changefrom] = penalty_before_p1\n    penalties[changeto] = penalty_before_p2\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2822, "cpu_time_ms": 1864, "memory_kb": 3484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s651972307", "group_id": "codeNet:p02618", "input_text": "local read = io.read\n\nlocal D = read(\"*n\")\nlocal c = {}\nlocal kind = 26\nfor i = 1, kind do\n\tc[i] = read(\"*n\")\nend\nlocal s = {}\nfor i = 1, D do\n\ts[i] = {}\n\tfor j = 1, kind do\n\t\ts[i][j] = read(\"*n\")\n\tend\nend\n\nlocal bestContest, bestSum = -1, -1\nfor j = 1, kind do\n\tlocal sum = 0\n\tfor i = 1, D do\n\t\tsum = sum + s[i][j]\n\tend\n\tif sum > bestSum then\n\t\tbestContest, bestSum = j, sum\n\tend\nend\n\nfor i = 1, D do\n\tprint(bestContest)\nend\n", "language": "Lua", "metadata": {"date": 1593397093, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s651972307.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651972307", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local read = io.read\n\nlocal D = read(\"*n\")\nlocal c = {}\nlocal kind = 26\nfor i = 1, kind do\n\tc[i] = read(\"*n\")\nend\nlocal s = {}\nfor i = 1, D do\n\ts[i] = {}\n\tfor j = 1, kind do\n\t\ts[i][j] = read(\"*n\")\n\tend\nend\n\nlocal bestContest, bestSum = -1, -1\nfor j = 1, kind do\n\tlocal sum = 0\n\tfor i = 1, D do\n\t\tsum = sum + s[i][j]\n\tend\n\tif sum > bestSum then\n\t\tbestContest, bestSum = j, sum\n\tend\nend\n\nfor i = 1, D do\n\tprint(bestContest)\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s416794833", "group_id": "codeNet:p02618", "input_text": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal ld = {}\nlocal function solveAll(t)\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    ld[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - ld[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\n\nlocal candidate = {}\nfor i = 1, 365 do\n  candidate[i] = {}\n  for j = 1, 26 do\n    if 1 + (i % 26) ~= j then\n      table.insert(candidate[i], j)\n    end\n  end\nend\nlocal day_candidate = {}\nfor i = 1, 365 do day_candidate[i] = i end\n\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  if #day_candidate == 0 then\n    -- reset\n    for i = 1, 365 do\n      day_candidate[i] = i\n      candidate[i] = {}\n      for j = 1, 26 do\n        if t[i] ~= j then\n          table.insert(candidate[i], j)\n        end\n      end\n    end\n  end\n  local changeday_idx = random(1, #day_candidate)\n  local changeday = day_candidate[changeday_idx]\n  local changeto_idx = random(1, #candidate[changeday])\n  local changeto = candidate[changeday][changeto_idx]\n  table.remove(candidate[changeday], changeto_idx)\n  if #candidate[changeday] == 0 then\n    table.remove(day_candidate, changeday_idx)\n  end\n  local changefrom = t[changeday]\n  -- if changefrom <= changeto then\n  --   changeto = changeto + 1\n  -- end\n  local score_before_p1 = scores[changefrom]\n  local score_before_p2 = scores[changeto]\n  local penalty_before_p1 = penalties[changefrom]\n  local penalty_before_p2 = penalties[changeto]\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n  else\n    scores[changefrom] = score_before_p1\n    scores[changeto] = score_before_p2\n    penalties[changefrom] = penalty_before_p1\n    penalties[changeto] = penalty_before_p2\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1593397027, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s416794833.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s416794833", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal ld = {}\nlocal function solveAll(t)\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    ld[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - ld[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\n\nlocal candidate = {}\nfor i = 1, 365 do\n  candidate[i] = {}\n  for j = 1, 26 do\n    if 1 + (i % 26) ~= j then\n      table.insert(candidate[i], j)\n    end\n  end\nend\nlocal day_candidate = {}\nfor i = 1, 365 do day_candidate[i] = i end\n\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  if #day_candidate == 0 then\n    -- reset\n    for i = 1, 365 do\n      day_candidate[i] = i\n      candidate[i] = {}\n      for j = 1, 26 do\n        if t[i] ~= j then\n          table.insert(candidate[i], j)\n        end\n      end\n    end\n  end\n  local changeday_idx = random(1, #day_candidate)\n  local changeday = day_candidate[changeday_idx]\n  local changeto_idx = random(1, #candidate[changeday])\n  local changeto = candidate[changeday][changeto_idx]\n  table.remove(candidate[changeday], changeto_idx)\n  if #candidate[changeday] == 0 then\n    table.remove(day_candidate, changeday_idx)\n  end\n  local changefrom = t[changeday]\n  -- if changefrom <= changeto then\n  --   changeto = changeto + 1\n  -- end\n  local score_before_p1 = scores[changefrom]\n  local score_before_p2 = scores[changeto]\n  local penalty_before_p1 = penalties[changefrom]\n  local penalty_before_p2 = penalties[changeto]\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n  else\n    scores[changefrom] = score_before_p1\n    scores[changeto] = score_before_p2\n    penalties[changefrom] = penalty_before_p1\n    penalties[changeto] = penalty_before_p2\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2773, "cpu_time_ms": 1863, "memory_kb": 3544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s169846231", "group_id": "codeNet:p02618", "input_text": "local read = io.read\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nlocal s = {}\nfor i = 1, D do\n\ts[i] = {}\n\tfor j = 1, 26 do\n\t\ts[i][j] = read(\"*n\")\n\tend\nend\n\nlocal function MaxIndexAndVar(list)\n\tlocal maxIndex, maxVar = -1, -1\n\tfor i = 1, #list do\n\t\tif list[i] > maxVar then\n\t\t\tmaxIndex, maxVar = i, list[i]\n\t\tend\n\tend\n\treturn maxIndex, maxVar\nend\n\nfor i = 1, D do\n\tlocal t = MaxIndexAndVar(s[i])\n\tprint(t)\nend\n", "language": "Lua", "metadata": {"date": 1593396336, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s169846231.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169846231", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local read = io.read\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nlocal s = {}\nfor i = 1, D do\n\ts[i] = {}\n\tfor j = 1, 26 do\n\t\ts[i][j] = read(\"*n\")\n\tend\nend\n\nlocal function MaxIndexAndVar(list)\n\tlocal maxIndex, maxVar = -1, -1\n\tfor i = 1, #list do\n\t\tif list[i] > maxVar then\n\t\t\tmaxIndex, maxVar = i, list[i]\n\t\tend\n\tend\n\treturn maxIndex, maxVar\nend\n\nfor i = 1, D do\n\tlocal t = MaxIndexAndVar(s[i])\n\tprint(t)\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 440, "cpu_time_ms": 13, "memory_kb": 2732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s971742113", "group_id": "codeNet:p02618", "input_text": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal function solveAll(t)\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - lastday[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  local ld = {}\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  local changeday = random(1, 365)\n  local changeto = random(1, 25)\n  local changefrom = t[changeday]\n  if changefrom <= changeto then\n    changeto = changeto + 1\n  end\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n  else\n    solveDiff(t, changeday, changefrom)\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1593395791, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s971742113.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971742113", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal scores = {}\nlocal penalties = {}\nfor i = 1, 26 do\n  scores[i] = 0\n  penalties[i] = 0\nend\nlocal function solveAll(t)\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    scores[pid] = scores[pid] + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      penalties[i] = penalties[i] + c[i] * (id - lastday[i])\n    end\n  end\nend\nlocal function solveDiff(t, iday, pto)\n  local pfrom = t[iday]\n  scores[pfrom] = scores[pfrom] - s[iday][pfrom]\n  scores[pto] = scores[pto] + s[iday][pto]\n  t[iday] = pto\n  penalties[pfrom] = 0\n  penalties[pto] = 0\n  local ld = {}\n  for i = 1, 26 do ld[i] = 0 end\n  for id = 1, day do\n    local p = t[id]\n    ld[p] = id\n    for ip = pfrom, pto, (pto - pfrom) do\n      penalties[ip] = penalties[ip] + c[ip] * (id - ld[ip])\n    end\n  end\nend\n\nlocal function solveSum()\n  local z = 0\n  for i = 1, 26 do z = z + scores[i] - penalties[i] end\n  return z\nend\n\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nsolveAll(t)\nlocal score = solveSum()\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  local changeday = random(1, 365)\n  local changeto = random(1, 25)\n  local changefrom = t[changeday]\n  if changefrom <= changeto then\n    changeto = changeto + 1\n  end\n  solveDiff(t, changeday, changeto)\n  local tmp = solveSum()\n  if score < tmp then\n    score = tmp\n  else\n    solveDiff(t, changeday, changefrom)\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1701, "cpu_time_ms": 1863, "memory_kb": 3120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s579812437", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\nfor i=1,D do\n\tlocal lastt={}\n\tfor j=1,26 do\n\t\tlastt[j]=copy(last)\n\tend\n\t\n\tlocal max=calc(i,1,lastt[1])\n\tret[i]=1\n\tfor j=2,26 do\n\t\tlocal c=calc(i,j,lastt[j])\n\t\tif(c>max)then\n\t\t\tmax=c\n\t\t\tret[i]=j\n\t\tend\n\tend\n\tlast=lastt[ret[i]]\nend\n\nfor i=1,D do print(ret[i])end", "language": "Lua", "metadata": {"date": 1593395620, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s579812437.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579812437", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\nfor i=1,D do\n\tlocal lastt={}\n\tfor j=1,26 do\n\t\tlastt[j]=copy(last)\n\tend\n\t\n\tlocal max=calc(i,1,lastt[1])\n\tret[i]=1\n\tfor j=2,26 do\n\t\tlocal c=calc(i,j,lastt[j])\n\t\tif(c>max)then\n\t\t\tmax=c\n\t\t\tret[i]=j\n\t\tend\n\tend\n\tlast=lastt[ret[i]]\nend\n\nfor i=1,D do print(ret[i])end", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 704, "cpu_time_ms": 28, "memory_kb": 3024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s727586775", "group_id": "codeNet:p02618", "input_text": "local rand = math.random\nlocal read = io.read\n\nmath.randomseed(os.time())\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nfor i = 1, D + 1 do\n\tread(\"*l\")\nend\n\n--[[\nlocal function randNoDuplication(list)\n\tlocal num = rand(1, #list)\n\tfor i = 1, #list do\n\t\tif list[i] == num then\n\t\t\treturn randNoDuplication(list)\n\t\tend\n\tend\n\treturn num\nend\n]]\n\nfor i = 1, D do\n\tprint(rand(1, 26))\nend\n", "language": "Lua", "metadata": {"date": 1593395092, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s727586775.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727586775", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local rand = math.random\nlocal read = io.read\n\nmath.randomseed(os.time())\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nfor i = 1, D + 1 do\n\tread(\"*l\")\nend\n\n--[[\nlocal function randNoDuplication(list)\n\tlocal num = rand(1, #list)\n\tfor i = 1, #list do\n\t\tif list[i] == num then\n\t\t\treturn randNoDuplication(list)\n\t\tend\n\tend\n\treturn num\nend\n]]\n\nfor i = 1, D do\n\tprint(rand(1, 26))\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 6, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s038160151", "group_id": "codeNet:p02618", "input_text": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\nfor i=1,D do\n\tlocal max=0\n\tlocal lastt={}\n\tfor j=1,26 do\n\t\tlastt[j]=copy(last)\n\tend\n\tfor j=1,26 do\n\t\tlocal c=calc(i,j,lastt[j])\n\t\tif(c>max)then\n\t\t\tmax=c\n\t\t\tret[i]=j\n\t\tend\n\tend\n\tlast=lastt[ret[i]]\nend\n\nfor i=1,D do print(ret[i])end", "language": "Lua", "metadata": {"date": 1593394896, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s038160151.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s038160151", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local D=io.read\"*n\"\n\nlocal c={}\nfor i=1,26 do c[i]=io.read\"*n\"end\nlocal s={}\nfor i=1,D do s[i]={}for j=1,26 do s[i][j]=io.read\"*n\"end end\n\nlocal function copy(t)local ret={}for i,v in ipairs(t)do ret[i]=v end return ret end\n\nlocal function calc(d,t,l)\n\tlocal a=0\n\tl[t]=d\n\tfor j=1,26 do\n\t\ta=a-c[j]*(d-l[j])\n\tend\n\treturn a+s[d][t]\nend\n\nlocal t={}\nfor i=1,D do t[i]=io.read\"*n\"end\n\nlocal last={}\nfor i=1,26 do\nlast[i]=0\nend\n\nlocal ret={}\nlocal a=0\nfor i=1,D do\n\tlocal max=0\n\tlocal lastt={}\n\tfor j=1,26 do\n\t\tlastt[j]=copy(last)\n\tend\n\tfor j=1,26 do\n\t\tlocal c=calc(i,j,lastt[j])\n\t\tif(c>max)then\n\t\t\tmax=c\n\t\t\tret[i]=j\n\t\tend\n\tend\n\tlast=lastt[ret[i]]\nend\n\nfor i=1,D do print(ret[i])end", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 675, "cpu_time_ms": 18, "memory_kb": 2992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s166737500", "group_id": "codeNet:p02618", "input_text": "local rand = math.random\nlocal read = io.read\n\nmath.randomseed(os.time())\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nfor i = 1, D + 1 do\n\tread(\"*l\")\nend\n\n--[[\nlocal function randNoDuplication(list)\n\tlocal num = rand(1, #list)\n\tfor i = 1, #list do\n\t\tif list[i] == num then\n\t\t\treturn randNoDuplication(list)\n\t\tend\n\tend\n\treturn num\nend\n]]\n\nfor i = 1, D do\n\tprint(rand(1, 26))\nend\n", "language": "Lua", "metadata": {"date": 1593394771, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s166737500.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166737500", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local rand = math.random\nlocal read = io.read\n\nmath.randomseed(os.time())\n\nlocal D = read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n\tc[i] = read(\"*n\")\nend\nfor i = 1, D + 1 do\n\tread(\"*l\")\nend\n\n--[[\nlocal function randNoDuplication(list)\n\tlocal num = rand(1, #list)\n\tfor i = 1, #list do\n\t\tif list[i] == num then\n\t\t\treturn randNoDuplication(list)\n\t\tend\n\tend\n\treturn num\nend\n]]\n\nfor i = 1, D do\n\tprint(rand(1, 26))\nend\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 5, "memory_kb": 2776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s244382879", "group_id": "codeNet:p02618", "input_text": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal function solve(t, debug)\n  local cur = 0\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    cur = cur + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      cur = cur - c[i] * (id - lastday[i])\n    end\n    if debug then print(cur) end\n  end\n  return cur\nend\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nlocal score = solve(t)\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  local changeday = random(1, 365)\n  local changeto = random(1, 26)\n  local changefrom = t[changeday]\n  t[changeday] = changeto\n  local tmp = solve(t)\n  if score < tmp then\n    score = tmp\n  else\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1593394586, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s244382879.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s244382879", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal function solve(t, debug)\n  local cur = 0\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    cur = cur + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      cur = cur - c[i] * (id - lastday[i])\n    end\n    if debug then print(cur) end\n  end\n  return cur\nend\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nlocal score = solve(t)\nmath.randomseed(1)\nlocal iter = 1\nlocal random = math.random\nwhile os.clock() < 1.85 do\n  iter = iter + 1\n  local changeday = random(1, 365)\n  local changeto = random(1, 26)\n  local changefrom = t[changeday]\n  t[changeday] = changeto\n  local tmp = solve(t)\n  if score < tmp then\n    score = tmp\n  else\n    t[changeday] = changefrom\n  end\nend\n-- print(iter)\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 982, "cpu_time_ms": 1865, "memory_kb": 3048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s474845247", "group_id": "codeNet:p02618", "input_text": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal function solve(t, debug)\n  local cur = 0\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    cur = cur + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      cur = cur - c[i] * (id - lastday[i])\n    end\n    if debug then print(cur) end\n  end\n  return cur\nend\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nlocal score = solve(t)\nmath.randomseed(1)\nlocal random = math.random\nwhile os.clock() < 1.5 do\n  local changeday = random(1, 365)\n  local changeto = random(1, 26)\n  local changefrom = t[changeday]\n  t[changeday] = changeto\n  local tmp = solve(t)\n  if score < tmp then\n    score = tmp\n  else\n    t[changeday] = changefrom\n  end\nend\nprint(table.concat(t, \"\\n\"))\n", "language": "Lua", "metadata": {"date": 1593394286, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s474845247.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474845247", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "local day = io.read(\"*n\")\nlocal c = {}\nfor i = 1, 26 do\n  c[i] = io.read(\"*n\")\nend\nlocal s = {}\nfor id = 1, day do\n  s[id] = {}\n  for i = 1, 26 do\n    s[id][i] = io.read(\"*n\")\n  end\nend\n\nlocal function solve(t, debug)\n  local cur = 0\n  local lastday = {}\n  for i = 1, 26 do lastday[i] = 0 end\n  for id = 1, day do\n    local pid = t[id]\n    cur = cur + s[id][pid]\n    lastday[pid] = id\n    for i = 1, 26 do\n      cur = cur - c[i] * (id - lastday[i])\n    end\n    if debug then print(cur) end\n  end\n  return cur\nend\nlocal t = {}\nfor id = 1, day do\n  t[id] = 1 + (id % 26)\nend\nlocal score = solve(t)\nmath.randomseed(1)\nlocal random = math.random\nwhile os.clock() < 1.5 do\n  local changeday = random(1, 365)\n  local changeto = random(1, 26)\n  local changefrom = t[changeday]\n  t[changeday] = changeto\n  local tmp = solve(t)\n  if score < tmp then\n    score = tmp\n  else\n    t[changeday] = changefrom\n  end\nend\nprint(table.concat(t, \"\\n\"))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 933, "cpu_time_ms": 1517, "memory_kb": 3084}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s762721817", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\n-----\n-----\nlocal last = array(1, 0)\nfor d=1,D do\n    local amax = -10^18\n    local maxi = 1\n    for i=1,26 do\n        local ans = S[d][i]\n        for j=1,26 do\n            if j ~= i then\n                ans = ans - C[j] * (d - last[j])\n            end\n        end\n        if ans > amax then\n            amax = ans\n            maxi = i\n        end\n    end\n    last[maxi] = d\n    print(maxi)\nend", "language": "Lua", "metadata": {"date": 1593393901, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s762721817.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762721817", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\n-----\n-----\nlocal last = array(1, 0)\nfor d=1,D do\n    local amax = -10^18\n    local maxi = 1\n    for i=1,26 do\n        local ans = S[d][i]\n        for j=1,26 do\n            if j ~= i then\n                ans = ans - C[j] * (d - last[j])\n            end\n        end\n        if ans > amax then\n            amax = ans\n            maxi = i\n        end\n    end\n    last[maxi] = d\n    print(maxi)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3101, "cpu_time_ms": 42, "memory_kb": 3780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s052589265", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\n-----\n-----\nlocal last = array(1, 0)\nfor d=1,D do\n    local amax = 0\n    local maxi = -1\n    for i=1,26 do\n        local ans = S[d][i]\n        for j=1,26 do\n            if j ~= i then\n                ans = ans - C[j] * (d - last[j])\n            end\n        end\n        if ans > amax then\n            amax = ans\n            maxi = i\n        end\n    end\n    last[maxi] = d\n    print(maxi)\nend", "language": "Lua", "metadata": {"date": 1593393597, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s052589265.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s052589265", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nlocal C = read.N(26)\nlocal S = {}\nfor i=1,D do\n    S[i] = read.N(26)\nend\n-----\n-----\nlocal last = array(1, 0)\nfor d=1,D do\n    local amax = 0\n    local maxi = -1\n    for i=1,26 do\n        local ans = S[d][i]\n        for j=1,26 do\n            if j ~= i then\n                ans = ans - C[j] * (d - last[j])\n            end\n        end\n        if ans > amax then\n            amax = ans\n            maxi = i\n        end\n    end\n    last[maxi] = d\n    print(maxi)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s990835480", "group_id": "codeNet:p02618", "input_text": "for i = 1, 365 do print(1 + (i % 26)) end", "language": "Lua", "metadata": {"date": 1593393279, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s990835480.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990835480", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "for i = 1, 365 do print(1 + (i % 26)) end", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s148242412", "group_id": "codeNet:p02618", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nfor i=1,D do\n    print(1)\nend", "language": "Lua", "metadata": {"date": 1593392690, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lua/s148242412.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s148242412", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 D = read.n()\nfor i=1,D do\n    print(1)\nend", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2663, "cpu_time_ms": 10, "memory_kb": 2804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s824175428", "group_id": "codeNet:p02623", "input_text": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans, j = 0, M\nfor i = 0, N do\n  if a[i] > K then break end\n  while b[j] > K - a[i] do j = j - 1 end\n  ans = math.max(ans, i + j)\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1599999715, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s824175428.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s824175428", "user_id": "u878654696"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans, j = 0, M\nfor i = 0, N do\n  if a[i] > K then break end\n  while b[j] > K - a[i] do j = j - 1 end\n  ans = math.max(ans, i + j)\nend\n\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 88, "memory_kb": 10880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s662945450", "group_id": "codeNet:p02623", "input_text": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans = 0\nfor i = 0, N do\n  if a[i] > K then break end\n  left = 0\n  right = M + 1\n  while right - left > 1 do\n    cur = (left + right) // 2\n    if b[cur] <= K - a[i] then\n      left = cur\n    else\n      right = cur\n    end\n  end\n  ans = math.max(ans, i + left)\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1599999491, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s662945450.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s662945450", "user_id": "u878654696"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans = 0\nfor i = 0, N do\n  if a[i] > K then break end\n  left = 0\n  right = M + 1\n  while right - left > 1 do\n    cur = (left + right) // 2\n    if b[cur] <= K - a[i] then\n      left = cur\n    else\n      right = cur\n    end\n  end\n  ans = math.max(ans, i + left)\nend\n\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 526, "cpu_time_ms": 587, "memory_kb": 18660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s526711839", "group_id": "codeNet:p02623", "input_text": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans = 0\nfor i = 1, N do\n  if a[i] > K then break end\n  left = 0\n  right = M + 1\n  while right - left > 1 do\n    cur = (left + right) // 2\n    if b[cur] <= K - a[i] then\n      left = cur\n    else\n      right = cur\n    end\n  end\n  ans = math.max(ans, i + left)\nend\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1599999118, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s526711839.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s526711839", "user_id": "u878654696"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N, M, K = io.read(\"*n\",\"*n\",\"*n\")\nA = {}; for i = 1, N do A[i] = io.read(\"*n\") end\nB = {}; for i = 1, M do B[i] = io.read(\"*n\") end\n\na = {}; a[0] = 0\nfor i = 1, N do a[i] = a[i-1] + A[i] end\n\nb = {}; b[0] = 0\nfor i = 1, M do b[i] = b[i-1] + B[i] end\n\nans = 0\nfor i = 1, N do\n  if a[i] > K then break end\n  left = 0\n  right = M + 1\n  while right - left > 1 do\n    cur = (left + right) // 2\n    if b[cur] <= K - a[i] then\n      left = cur\n    else\n      right = cur\n    end\n  end\n  ans = math.max(ans, i + left)\nend\n\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 526, "cpu_time_ms": 592, "memory_kb": 18644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s339018376", "group_id": "codeNet:p02623", "input_text": "local n,m,k=io.read(\"n\",\"n\",\"n\")\nlocal a={[0]=0}\nfor i=1,n do\n    a[i]=a[i-1]+io.read(\"n\")\nend\nlocal b={[0]=0}\nfor i=1,m do\n    b[i]=b[i-1]+io.read(\"n\")\nend\n\nlocal max=0\nlocal j=m\nfor i=0,n do\n    if a[i]>k then\n        break\n    end\n    while b[j]>k-a[i] do\n        j=j-1\n    end\n    max=math.max(max,i+j)\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595564739, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s339018376.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339018376", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n,m,k=io.read(\"n\",\"n\",\"n\")\nlocal a={[0]=0}\nfor i=1,n do\n    a[i]=a[i-1]+io.read(\"n\")\nend\nlocal b={[0]=0}\nfor i=1,m do\n    b[i]=b[i-1]+io.read(\"n\")\nend\n\nlocal max=0\nlocal j=m\nfor i=0,n do\n    if a[i]>k then\n        break\n    end\n    while b[j]>k-a[i] do\n        j=j-1\n    end\n    max=math.max(max,i+j)\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 86, "memory_kb": 6668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s952077226", "group_id": "codeNet:p02623", "input_text": "local read = io.read\nlocal insert = table.insert\nlocal max = math.max\nlocal abs, floor = math.abs, math.floor\n\nlocal N, M, K = read(\"*n\", \"*n\", \"*n\")\nlocal A, B = {}, {}\n---indexが1多いことに注意\nlocal sumed_A, sumed_B = {0}, {0}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\n\tinsert(sumed_A, sumed_A[i] + A[i])\nend\nfor i = 1, M do\n\tB[i] = read(\"*n\")\n\tinsert(sumed_B, sumed_B[i] + B[i])\nend\n\n---[[i,jは1多いことに注意\nlocal ans, j = 0, M + 1\nfor i = 1, N + 1 do\n\tif sumed_A[i] > K then\n\t\tbreak\n\tend\n\twhile sumed_B[j] > K - sumed_A[i] do\n\t\tj = j - 1\n\tend\n\tans = max(ans, i + j - 2)\nend\n--]]\n\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1593321355, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s952077226.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952077226", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\nlocal max = math.max\nlocal abs, floor = math.abs, math.floor\n\nlocal N, M, K = read(\"*n\", \"*n\", \"*n\")\nlocal A, B = {}, {}\n---indexが1多いことに注意\nlocal sumed_A, sumed_B = {0}, {0}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\n\tinsert(sumed_A, sumed_A[i] + A[i])\nend\nfor i = 1, M do\n\tB[i] = read(\"*n\")\n\tinsert(sumed_B, sumed_B[i] + B[i])\nend\n\n---[[i,jは1多いことに注意\nlocal ans, j = 0, M + 1\nfor i = 1, N + 1 do\n\tif sumed_A[i] > K then\n\t\tbreak\n\tend\n\twhile sumed_B[j] > K - sumed_A[i] do\n\t\tj = j - 1\n\tend\n\tans = max(ans, i + j - 2)\nend\n--]]\n\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 607, "cpu_time_ms": 119, "memory_kb": 10860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s601617494", "group_id": "codeNet:p02623", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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, M, K = read.nnn()\nlocal A = read.N(N)\nlocal B = read.N(M)\nlocal C = {}\nfor i=1,N do\n    C[i] = A[N-i+1]\nend\nfor i=1,M do\n    C[i+N] = B[i]\nend\nlocal s = 0\nlocal n = 0\nlocal nmax = 0\nlocal left, right -- [left, right)\nlocal function printstate(a)\n    --print(a .. \";\", \"[\"..left..\",\"..right..\")\", s, n, nmax)\nend\nright = N + 1\nleft = N\ns = C[left]\nn = 1\nnmax = 1\nprintstate(1)\nif s > K then\n    s = 0\n    left = N + 1\n    nmax = 0\nend\nwhile true do\n    local testleft = left - 1\n    if testleft > 0 and s + C[testleft] <= K then\n        left = testleft\n        s = s + C[left]\n        n = n + 1\n        nmax = math.max(nmax, n)\n        assert(s <= K)\n    else\n        break\n    end\nend\nassert(s <= K)\nprintstate(2)\nlocal endflag = false\nwhile not endflag do\n    while true do\n        local testright = right + 1\n        if testright <= N+M+1 and s + C[testright-1] <= K then\n            right = testright\n            s = s + C[right-1]\n            n = n + 1\n            nmax = math.max(nmax, n)\n            printstate(3)\n        else\n            break\n        end\n    end\n    assert(s <= K)\n    local testleft = left + 1\n    if testleft > N+1 then\n        endflag = true\n        break\n    end\n    s = s - C[left]\n    n = n - 1\n    left = testleft\n    printstate(4)\n    assert(s <= K)\nend\nassert(s <= K)\nprint(nmax)", "language": "Lua", "metadata": {"date": 1593308221, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s601617494.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601617494", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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, M, K = read.nnn()\nlocal A = read.N(N)\nlocal B = read.N(M)\nlocal C = {}\nfor i=1,N do\n    C[i] = A[N-i+1]\nend\nfor i=1,M do\n    C[i+N] = B[i]\nend\nlocal s = 0\nlocal n = 0\nlocal nmax = 0\nlocal left, right -- [left, right)\nlocal function printstate(a)\n    --print(a .. \";\", \"[\"..left..\",\"..right..\")\", s, n, nmax)\nend\nright = N + 1\nleft = N\ns = C[left]\nn = 1\nnmax = 1\nprintstate(1)\nif s > K then\n    s = 0\n    left = N + 1\n    nmax = 0\nend\nwhile true do\n    local testleft = left - 1\n    if testleft > 0 and s + C[testleft] <= K then\n        left = testleft\n        s = s + C[left]\n        n = n + 1\n        nmax = math.max(nmax, n)\n        assert(s <= K)\n    else\n        break\n    end\nend\nassert(s <= K)\nprintstate(2)\nlocal endflag = false\nwhile not endflag do\n    while true do\n        local testright = right + 1\n        if testright <= N+M+1 and s + C[testright-1] <= K then\n            right = testright\n            s = s + C[right-1]\n            n = n + 1\n            nmax = math.max(nmax, n)\n            printstate(3)\n        else\n            break\n        end\n    end\n    assert(s <= K)\n    local testleft = left + 1\n    if testleft > N+1 then\n        endflag = true\n        break\n    end\n    s = s - C[left]\n    n = n - 1\n    left = testleft\n    printstate(4)\n    assert(s <= K)\nend\nassert(s <= K)\nprint(nmax)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3937, "cpu_time_ms": 543, "memory_kb": 40536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s978584285", "group_id": "codeNet:p02623", "input_text": "local mmi, mma = math.min, math.max\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal asum = {a[1]}\nfor i = 2, n do\n  asum[i] = asum[i - 1] + a[i]\nend\nlocal b = {}\nfor i = 1, m do\n  b[i] = io.read(\"*n\")\nend\nlocal bsum = {b[1]}\nfor i = 2, m do\n  bsum[i] = bsum[i - 1] + b[i]\nend\nlocal blim = m\nlocal ret = 0\nfor i = 0, n do\n  local az = i == 0 and 0 or asum[i]\n  if k < az then break end\n  while 0 < blim and k < az + bsum[blim] do\n    blim = blim - 1\n  end\n  ret = mma(ret, i + blim)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1593306330, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s978584285.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978584285", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal asum = {a[1]}\nfor i = 2, n do\n  asum[i] = asum[i - 1] + a[i]\nend\nlocal b = {}\nfor i = 1, m do\n  b[i] = io.read(\"*n\")\nend\nlocal bsum = {b[1]}\nfor i = 2, m do\n  bsum[i] = bsum[i - 1] + b[i]\nend\nlocal blim = m\nlocal ret = 0\nfor i = 0, n do\n  local az = i == 0 and 0 or asum[i]\n  if k < az then break end\n  while 0 < blim and k < az + bsum[blim] do\n    blim = blim - 1\n  end\n  ret = mma(ret, i + blim)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 126, "memory_kb": 18672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s479108296", "group_id": "codeNet:p02623", "input_text": "local mmi, mma = math.min, math.max\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal asum = {a[1]}\nfor i = 2, n do\n  asum[i] = asum[i - 1] + a[i]\nend\nlocal b = {}\nfor i = 1, m do\n  b[i] = io.read(\"*n\")\nend\nlocal bsum = {b[1]}\nfor i = 2, m do\n  bsum[i] = bsum[i - 1] + b[i]\nend\nlocal blim = m\nlocal ret = 0\nfor i = 1, n do\n  local az = asum[i]\n  if k < az then break end\n  while 0 < blim and k < az + bsum[blim] do\n    blim = blim - 1\n  end\n  ret = mma(ret, i + blim)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1593306289, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lua/s479108296.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s479108296", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n, m, k = io.read(\"*n\", \"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal asum = {a[1]}\nfor i = 2, n do\n  asum[i] = asum[i - 1] + a[i]\nend\nlocal b = {}\nfor i = 1, m do\n  b[i] = io.read(\"*n\")\nend\nlocal bsum = {b[1]}\nfor i = 2, m do\n  bsum[i] = bsum[i - 1] + b[i]\nend\nlocal blim = m\nlocal ret = 0\nfor i = 1, n do\n  local az = asum[i]\n  if k < az then break end\n  while 0 < blim and k < az + bsum[blim] do\n    blim = blim - 1\n  end\n  ret = mma(ret, i + blim)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, 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 M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 537, "cpu_time_ms": 129, "memory_kb": 18676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s043707296", "group_id": "codeNet:p02624", "input_text": "local n=io.read(\"n\")\nlocal counter=0\nfor i=1,n do\n    counter=counter+n//i*(n//i+1)//2*i\nend\nprint(counter)\n", "language": "Lua", "metadata": {"date": 1595735784, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lua/s043707296.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043707296", "user_id": "u045238009"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal counter=0\nfor i=1,n do\n    counter=counter+n//i*(n//i+1)//2*i\nend\nprint(counter)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 572, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s025261565", "group_id": "codeNet:p02624", "input_text": "local N = io.read(\"n\")\nlocal s = 0\nfor i=1,N do\n    local n = N // i\n    local t = (i + n * i) * n // 2\n    s = s + t\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1593313882, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lua/s025261565.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025261565", "user_id": "u162773977"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal s = 0\nfor i=1,N do\n    local n = N // i\n    local t = (i + n * i) * n // 2\n    s = s + t\nend\nprint(s)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 435, "memory_kb": 2736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s979505936", "group_id": "codeNet:p02624", "input_text": "local n = io.read(\"*n\")\nlocal ret = 0\nfor i = 1, n do\n  local cnt = n // i\n  ret = ret + i * cnt * (cnt + 1) // 2\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1593306796, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lua/s979505936.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979505936", "user_id": "u120582723"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal ret = 0\nfor i = 1, n do\n  local cnt = n // i\n  ret = ret + i * cnt * (cnt + 1) // 2\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 460, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s177678461", "group_id": "codeNet:p02642", "input_text": "-- RayStark氏のコードを参考にした\n\nlocal read = io.read\nlocal floor = math.floor\nlocal N = read(\"*n\")\nlocal A = {}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\nend\ntable.sort(A)\n\nlocal A_MAX = A[N]\n\nlocal cant_div_s = {}\nfor i = 1, N do\n\t-- なんでcant_divs[i],(1<=i<=A_MAX)でないか\n\t-- A[i]にない数字は考えなくて良いから\n\tcant_div_s[A[i]] = true\nend\n\nlocal last_value = 0\nfor i = 1, N do\n\t-- cant_divs全部回したら時間かかるんじゃないのか\n\t-- []のなかにA[i],(1<=i<=N)を使ってるので1つ目のfor文自体はN回\n\tif cant_div_s[A[i]] and last_value == A[i] then\n\t\tcant_div_s[A[i]] = false\n\telseif cant_div_s[A[i]] then\n\t\t-- なんでj=1でなく2か\n\t\t-- A_MAXまでのA[i]より大きい倍数は倍数だから\n\t\t-- TODO: ここがボトルネックになっているためここの最適化したい\n\t\tfor j = 2, floor(A_MAX / A[i]) do\n\t\t\tcant_div_s[A[i] * j] = false\n\t\tend\n\t\t-- なんで最後に処理した数字を残しておく必要があるか\n\t\t-- Aに同じ数が存在する場合にはじくため\n\t\tlast_value = A[i]\n\tend\nend\n\nlocal num = 0\nfor i = 1, N do\n\tif cant_div_s[A[i]] then\n\t\tnum = num + 1\n\tend\nend\n\nprint(num)\n", "language": "Lua", "metadata": {"date": 1592973510, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s177678461.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177678461", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "-- RayStark氏のコードを参考にした\n\nlocal read = io.read\nlocal floor = math.floor\nlocal N = read(\"*n\")\nlocal A = {}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\nend\ntable.sort(A)\n\nlocal A_MAX = A[N]\n\nlocal cant_div_s = {}\nfor i = 1, N do\n\t-- なんでcant_divs[i],(1<=i<=A_MAX)でないか\n\t-- A[i]にない数字は考えなくて良いから\n\tcant_div_s[A[i]] = true\nend\n\nlocal last_value = 0\nfor i = 1, N do\n\t-- cant_divs全部回したら時間かかるんじゃないのか\n\t-- []のなかにA[i],(1<=i<=N)を使ってるので1つ目のfor文自体はN回\n\tif cant_div_s[A[i]] and last_value == A[i] then\n\t\tcant_div_s[A[i]] = false\n\telseif cant_div_s[A[i]] then\n\t\t-- なんでj=1でなく2か\n\t\t-- A_MAXまでのA[i]より大きい倍数は倍数だから\n\t\t-- TODO: ここがボトルネックになっているためここの最適化したい\n\t\tfor j = 2, floor(A_MAX / A[i]) do\n\t\t\tcant_div_s[A[i] * j] = false\n\t\tend\n\t\t-- なんで最後に処理した数字を残しておく必要があるか\n\t\t-- Aに同じ数が存在する場合にはじくため\n\t\tlast_value = A[i]\n\tend\nend\n\nlocal num = 0\nfor i = 1, N do\n\tif cant_div_s[A[i]] then\n\t\tnum = num + 1\n\tend\nend\n\nprint(num)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1185, "cpu_time_ms": 157, "memory_kb": 19212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s213812527", "group_id": "codeNet:p02642", "input_text": "-- RayStark氏のコードを参考にした\n\nlocal read = io.read\nlocal floor = math.floor\nlocal N = read(\"*n\")\nlocal A = {}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\nend\ntable.sort(A)\n\nlocal A_MAX = A[N]\n\nlocal cant_div_s = {}\nfor i = 1, N do\n\t-- なんでcant_divs[i],(1<=i<=N)でないか\n\t-- A[i]にない数字は考えなくて良いから\n\tcant_div_s[A[i]] = true\nend\n\nlocal last_value = 0\nfor i = 1, N do\n\t-- cant_divs全部回したら時間かかるんじゃないのか？\n\t-- []のなかにA[i],(1<=i<=N)を使ってるのでN回の計算で済む\n\tif cant_div_s[A[i]] and last_value == A[i] then\n\t\tcant_div_s[A[i]] = false\n\telseif cant_div_s[A[i]] then\n\t\t-- なんでj=1でなく2か\n\t\t-- A_MAXまでのA[i]より大きい倍数は倍数だから\n\t\t-- TODO: ここがボトルネックになっているためここの最適化\n\t\tfor j = 2, floor(A_MAX / A[i]) do\n\t\t\tcant_div_s[A[i] * j] = false\n\t\tend\n\t\t-- なんで最後に処理した数字を残しておく必要があるか\n\t\t-- 同じ数が存在する場合にはじくため\n\t\tlast_value = A[i]\n\tend\nend\n\nlocal num = 0\nfor i = 1, N do\n\tif cant_div_s[A[i]] then\n\t\tnum = num + 1\n\tend\nend\n\nprint(num)\n", "language": "Lua", "metadata": {"date": 1592972991, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s213812527.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s213812527", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "-- RayStark氏のコードを参考にした\n\nlocal read = io.read\nlocal floor = math.floor\nlocal N = read(\"*n\")\nlocal A = {}\nfor i = 1, N do\n\tA[i] = read(\"*n\")\nend\ntable.sort(A)\n\nlocal A_MAX = A[N]\n\nlocal cant_div_s = {}\nfor i = 1, N do\n\t-- なんでcant_divs[i],(1<=i<=N)でないか\n\t-- A[i]にない数字は考えなくて良いから\n\tcant_div_s[A[i]] = true\nend\n\nlocal last_value = 0\nfor i = 1, N do\n\t-- cant_divs全部回したら時間かかるんじゃないのか？\n\t-- []のなかにA[i],(1<=i<=N)を使ってるのでN回の計算で済む\n\tif cant_div_s[A[i]] and last_value == A[i] then\n\t\tcant_div_s[A[i]] = false\n\telseif cant_div_s[A[i]] then\n\t\t-- なんでj=1でなく2か\n\t\t-- A_MAXまでのA[i]より大きい倍数は倍数だから\n\t\t-- TODO: ここがボトルネックになっているためここの最適化\n\t\tfor j = 2, floor(A_MAX / A[i]) do\n\t\t\tcant_div_s[A[i] * j] = false\n\t\tend\n\t\t-- なんで最後に処理した数字を残しておく必要があるか\n\t\t-- 同じ数が存在する場合にはじくため\n\t\tlast_value = A[i]\n\tend\nend\n\nlocal num = 0\nfor i = 1, N do\n\tif cant_div_s[A[i]] then\n\t\tnum = num + 1\n\tend\nend\n\nprint(num)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1164, "cpu_time_ms": 168, "memory_kb": 19192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s223685725", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        if a[i]%j==0 then\n            if (a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0) then\n                checker=false\n                break\n            end\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592570186, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s223685725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223685725", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        if a[i]%j==0 then\n            if (a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0) then\n                checker=false\n                break\n            end\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 475, "memory_kb": 14008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s425100017", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        local ce=(a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0)\n        if a[i]%j==0 and ce then\n            checker=false\n            break\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592569877, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s425100017.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s425100017", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        local ce=(a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0)\n        if a[i]%j==0 and ce then\n            checker=false\n            break\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 2206, "memory_kb": 13992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s716292593", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        local ce=(a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0)\n        if a[i]%j==0 and ce then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592569742, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s716292593.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s716292593", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        local div=math.floor(a[i]/j)\n        local ce=(a_map[j] and a_map[j]>0) or (a_map[div] and a_map[div]>0)\n        if a[i]%j==0 and ce then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2206, "memory_kb": 14008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s537460150", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and (a_map[j] and a_map[j]>0) then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592569540, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s537460150.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s537460150", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    a_map[a[i]]=a_map[a[i]]-1\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and (a_map[j] and a_map[j]>0) then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\n    a_map[a[i]]=a_map[a[i]]+1\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 782, "memory_kb": 14000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s727148140", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and a_map[j] and a_map[j]-1>0 then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592568962, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s727148140.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s727148140", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and a_map[j] and a_map[j]-1>0 then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 766, "memory_kb": 14036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s641024061", "group_id": "codeNet:p02642", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and a_map[j] and a_map[j]-1>1 then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1592568836, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s641024061.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s641024061", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal a_map={}\nfor i=1,n do\n    local input=io.read(\"n\")\n    a[i]=input\n    a_map[input]=(a_map[input] or 0)+1\nend\n\nlocal counter=0\nfor i=1,n do\n    local checker=true\n    for j=1,math.sqrt(a[i]) do\n        if a[i]%j==0 and a_map[j] and a_map[j]-1>1 then\n            checker=false\n        end\n    end\n    if checker then\n        counter=counter+1\n    end\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 2206, "memory_kb": 18764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678932922", "group_id": "codeNet:p02642", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal yield = coroutine.yield\nlocal insert = table.insert\nlocal remove = table.remove\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    S[a] = S[a] - 1\n    local n = a\n    for i=1, floor(n ^ 0.5) do\n        if n % i == 0 then\n            local d = i\n            --print(a, d)\n            if S[d] and S[d] > 0 then\n                ok = false\n                break\n            end\n            d = floor(n / i)\n            --print(a, d)\n            if S[d] and S[d] > 0 then\n                ok = false\n                break\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\n    S[a] = S[a] + 1\nend\nprint(cnt)", "language": "Lua", "metadata": {"date": 1592187013, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s678932922.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678932922", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal yield = coroutine.yield\nlocal insert = table.insert\nlocal remove = table.remove\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    S[a] = S[a] - 1\n    local n = a\n    for i=1, floor(n ^ 0.5) do\n        if n % i == 0 then\n            local d = i\n            --print(a, d)\n            if S[d] and S[d] > 0 then\n                ok = false\n                break\n            end\n            d = floor(n / i)\n            --print(a, d)\n            if S[d] and S[d] > 0 then\n                ok = false\n                break\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\n    S[a] = S[a] + 1\nend\nprint(cnt)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3406, "cpu_time_ms": 575, "memory_kb": 16424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s816414000", "group_id": "codeNet:p02642", "input_text": "local read = io.read\nlocal insert = table.insert\nlocal N = read(\"*n\")\nlocal A = {}\nlocal has_A_s = {}\n\nfor i = 1, N do\n\tlocal num = read(\"*n\")\n\tif has_A_s[num] == nil then\n\t\thas_A_s[num] = true\n\t\tinsert(A, num)\n\tend\nend\n\nlocal count = 0\nfor i = 1, #A do\n\tfor j = 1, #A do\n\t\tif i == j then\n\t\telseif A[i] % A[j] == 0 then\n\t\t\tcount = count + 1\n\t\t\tbreak\n\t\tend\n\tend\nend\n\nprint((#A == 1) and 0 or #A - count)\n", "language": "Lua", "metadata": {"date": 1592186898, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s816414000.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s816414000", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local read = io.read\nlocal insert = table.insert\nlocal N = read(\"*n\")\nlocal A = {}\nlocal has_A_s = {}\n\nfor i = 1, N do\n\tlocal num = read(\"*n\")\n\tif has_A_s[num] == nil then\n\t\thas_A_s[num] = true\n\t\tinsert(A, num)\n\tend\nend\n\nlocal count = 0\nfor i = 1, #A do\n\tfor j = 1, #A do\n\t\tif i == j then\n\t\telseif A[i] % A[j] == 0 then\n\t\t\tcount = count + 1\n\t\t\tbreak\n\t\tend\n\tend\nend\n\nprint((#A == 1) and 0 or #A - count)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2206, "memory_kb": 13980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s030992135", "group_id": "codeNet:p02642", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal function gen_divisor(n)\n    return coroutine.wrap(function()\n        ds = {}\n        for i=1, floor(n ^ 0.5) do\n            if n % i == 0 then\n                coroutine.yield(i)\n                table.insert(ds, floor(n / i))\n            end\n        end\n        if floor(n / ds[#ds]) == ds[#ds] then\n            table.remove(ds)\n        end\n        for i=#ds,1,-1 do\n            coroutine.yield(ds[i])\n        end\n    end)\nend\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nif DBG then\n    print(tostringxx(S))\nend\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    S[a] = S[a] - 1\n    if DBG then\n        print(\"try\", a)\n    end\n    for d in gen_divisor(a) do\n        if S[d] and S[d] > 0 then\n            ok = false\n            if DBG then\n                print(\"d=\", d, false)\n            end\n            break\n        else\n            if DBG then\n                print(\"d=\", d, true)\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\n    S[a] = S[a] + 1\nend\nprint(cnt)", "language": "Lua", "metadata": {"date": 1592186658, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s030992135.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s030992135", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal function gen_divisor(n)\n    return coroutine.wrap(function()\n        ds = {}\n        for i=1, floor(n ^ 0.5) do\n            if n % i == 0 then\n                coroutine.yield(i)\n                table.insert(ds, floor(n / i))\n            end\n        end\n        if floor(n / ds[#ds]) == ds[#ds] then\n            table.remove(ds)\n        end\n        for i=#ds,1,-1 do\n            coroutine.yield(ds[i])\n        end\n    end)\nend\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nif DBG then\n    print(tostringxx(S))\nend\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    S[a] = S[a] - 1\n    if DBG then\n        print(\"try\", a)\n    end\n    for d in gen_divisor(a) do\n        if S[d] and S[d] > 0 then\n            ok = false\n            if DBG then\n                print(\"d=\", d, false)\n            end\n            break\n        else\n            if DBG then\n                print(\"d=\", d, true)\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\n    S[a] = S[a] + 1\nend\nprint(cnt)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3730, "cpu_time_ms": 2205, "memory_kb": 20188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s101883258", "group_id": "codeNet:p02642", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal function gen_divisor(n)\n    return coroutine.wrap(function()\n        ds = {}\n        for i=1, floor(n ^ 0.5) do\n            if n % i == 0 then\n                coroutine.yield(i)\n                table.insert(ds, floor(n / i))\n            end\n        end\n        if floor(n / ds[#ds]) == ds[#ds] then\n            table.remove(ds)\n        end\n        for i=#ds,1,-1 do\n            coroutine.yield(ds[i])\n        end\n    end)\nend\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    if S[a] > 1 then\n        ok = false\n    else\n        for d in gen_divisor(a) do\n            if d ~= 1 and d ~= a then\n                if S[d] then\n                    ok = false\n                end\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\nend\nprint(cnt)", "language": "Lua", "metadata": {"date": 1592185954, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s101883258.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s101883258", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 floor = math.floor\nlocal function gen_divisor(n)\n    return coroutine.wrap(function()\n        ds = {}\n        for i=1, floor(n ^ 0.5) do\n            if n % i == 0 then\n                coroutine.yield(i)\n                table.insert(ds, floor(n / i))\n            end\n        end\n        if floor(n / ds[#ds]) == ds[#ds] then\n            table.remove(ds)\n        end\n        for i=#ds,1,-1 do\n            coroutine.yield(ds[i])\n        end\n    end)\nend\n-------\nlocal N = read.n()\nlocal A = read.N(N)\nlocal S = {}\nfor i=1,N do\n    S[A[i]] = (S[A[i]] or 0) + 1\nend\nlocal cnt = 0\nfor i=1,N do\n    local ok = true\n    local a = A[i]\n    if S[a] > 1 then\n        ok = false\n    else\n        for d in gen_divisor(a) do\n            if d ~= 1 and d ~= a then\n                if S[d] then\n                    ok = false\n                end\n            end\n        end\n    end\n    if ok then\n        cnt = cnt + 1\n    end\nend\nprint(cnt)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3545, "cpu_time_ms": 1240, "memory_kb": 20252}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s491622129", "group_id": "codeNet:p02642", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal t = {}\nfor i = 1, 1000 * 1000 do\n  t[i] = 0\nend\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal acmp = {}\nfor i = 1, n do\n  local v = a[i]\n  if not acmp[v] then acmp[v] = 1\n  else acmp[v] = acmp[v] + 1\n  end\nend\nfor v, cnt in pairs(acmp) do\n  local lim = mfl(1000000 / v)\n  for j = 1, lim do\n    t[j * v] = t[j * v] + cnt\n  end\nend\nlocal c = 0\nfor i = 1, n do\n  local v = a[i]\n  if t[v] == 1 then\n    c = c + 1\n  end\nend\nprint(c)\n", "language": "Lua", "metadata": {"date": 1592183453, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s491622129.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491622129", "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 = {}\nlocal t = {}\nfor i = 1, 1000 * 1000 do\n  t[i] = 0\nend\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal acmp = {}\nfor i = 1, n do\n  local v = a[i]\n  if not acmp[v] then acmp[v] = 1\n  else acmp[v] = acmp[v] + 1\n  end\nend\nfor v, cnt in pairs(acmp) do\n  local lim = mfl(1000000 / v)\n  for j = 1, lim do\n    t[j * v] = t[j * v] + cnt\n  end\nend\nlocal c = 0\nfor i = 1, n do\n  local v = a[i]\n  if t[v] == 1 then\n    c = c + 1\n  end\nend\nprint(c)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 513, "cpu_time_ms": 108, "memory_kb": 22244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s716459645", "group_id": "codeNet:p02642", "input_text": "local mfl, mce = math.floor, math.ceil\nlocal n = io.read(\"*n\")\nlocal a = {}\nlocal t = {}\nfor i = 1, 1000 * 1000 do\n  t[i] = 0\nend\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n  local v = a[i]\n  local lim = mfl(1000000 / v)\n  for j = 1, lim do\n    t[j * v] = t[j * v] + 1\n  end\nend\nlocal c = 0\nfor i = 1, n do\n  local v = a[i]\n  if t[v] == 1 then\n    c = c + 1\n  end\nend\nprint(c)\n", "language": "Lua", "metadata": {"date": 1592183345, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lua/s716459645.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s716459645", "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 = {}\nlocal t = {}\nfor i = 1, 1000 * 1000 do\n  t[i] = 0\nend\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nfor i = 1, n do\n  local v = a[i]\n  local lim = mfl(1000000 / v)\n  for j = 1, lim do\n    t[j * v] = t[j * v] + 1\n  end\nend\nlocal c = 0\nfor i = 1, n do\n  local v = a[i]\n  if t[v] == 1 then\n    c = c + 1\n  end\nend\nprint(c)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\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 answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 393, "cpu_time_ms": 2206, "memory_kb": 12936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s126908835", "group_id": "codeNet:p02658", "input_text": "local n=io.read(\"n\")\nlocal answer=1\nlocal length=0\nfor i=1,n do\n    a=io.read(\"n\")\n    length=length+math.log(a,10)\n    answer=answer*a\nend\nif length>18 or answer>10^18 then\n    print(-1)\nelse\n    print(answer)\nend    ", "language": "Lua", "metadata": {"date": 1592968627, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s126908835.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126908835", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal answer=1\nlocal length=0\nfor i=1,n do\n    a=io.read(\"n\")\n    length=length+math.log(a,10)\n    answer=answer*a\nend\nif length>18 or answer>10^18 then\n    print(-1)\nelse\n    print(answer)\nend    ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 3044}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s007042072", "group_id": "codeNet:p02658", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal zero=false\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    if a[i]==0 then\n        zero=true\n    end\nend\nif zero then\n    print(0)\nelse\n    local answer=1\n    for i=1,n do\n        answer=answer*a[i]\n        if answer>10^18 then\n            print(-1)\n            return\n        end\n    end\n    print(string.format(\"%d\",answer))\nend\n", "language": "Lua", "metadata": {"date": 1592965918, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s007042072.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s007042072", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal zero=false\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    if a[i]==0 then\n        zero=true\n    end\nend\nif zero then\n    print(0)\nelse\n    local answer=1\n    for i=1,n do\n        answer=answer*a[i]\n        if answer>10^18 then\n            print(-1)\n            return\n        end\n    end\n    print(string.format(\"%d\",answer))\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 43, "memory_kb": 4240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s027399157", "group_id": "codeNet:p02658", "input_text": "local n=io.read(\"n\")\nlocal a={}\nlocal zero=false\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    if a[i]==0 then\n        zero=true\n    end\nend\nif zero then\n    print(0)\nelse\n    local answer=1\n    for i=1,n do\n        answer=answer*a[i]\n        if answer>10^18 then\n            print(-1)\n            return\n        end\n    end\n    print(answer)\nend\n", "language": "Lua", "metadata": {"date": 1592965878, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s027399157.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s027399157", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal a={}\nlocal zero=false\nfor i=1,n do\n    a[i]=io.read(\"n\")\n    if a[i]==0 then\n        zero=true\n    end\nend\nif zero then\n    print(0)\nelse\n    local answer=1\n    for i=1,n do\n        answer=answer*a[i]\n        if answer>10^18 then\n            print(-1)\n            return\n        end\n    end\n    print(answer)\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 42, "memory_kb": 4284}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s522696868", "group_id": "codeNet:p02658", "input_text": "local n=io.read(\"n\")\nlocal answer=1\nfor i=1,n do\n    answer=answer*io.read(\"n\")\n    if answer>10^18 then\n        print(-1)\n        return\n    end\nend\nprint(answer)", "language": "Lua", "metadata": {"date": 1592965466, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s522696868.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s522696868", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal answer=1\nfor i=1,n do\n    answer=answer*io.read(\"n\")\n    if answer>10^18 then\n        print(-1)\n        return\n    end\nend\nprint(answer)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s828623448", "group_id": "codeNet:p02658", "input_text": "local n=io.read(\"n\")\nlocal answer=1\nfor i=1,n do\n    answer=answer*io.read(\"n\")\nend\nif answer>10^18 then\n    print(-1)\nelse\n    print(answer)\nend", "language": "Lua", "metadata": {"date": 1592965355, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s828623448.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s828623448", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal answer=1\nfor i=1,n do\n    answer=answer*io.read(\"n\")\nend\nif answer>10^18 then\n    print(-1)\nelse\n    print(answer)\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820191417", "group_id": "codeNet:p02658", "input_text": "N=io.read\"*n\"\nA={}\nfor i=1,N do A[i]=io.read\"*n\"end\ntable.sort(A)\nif(A[1]==0)then print(0)return end\nm=1\nlim=10^18\nfor i=1,N do\n\tif(m<lim/A[i])then print(-1)return end\n\tm=m*A[i]\nend\nprint(m)", "language": "Lua", "metadata": {"date": 1592089884, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s820191417.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s820191417", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "N=io.read\"*n\"\nA={}\nfor i=1,N do A[i]=io.read\"*n\"end\ntable.sort(A)\nif(A[1]==0)then print(0)return end\nm=1\nlim=10^18\nfor i=1,N do\n\tif(m<lim/A[i])then print(-1)return end\n\tm=m*A[i]\nend\nprint(m)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 75, "memory_kb": 4320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s834315397", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tprint(out)\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nif 0 <= out and out <= max then\n\twhile true do\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590984206, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s834315397.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s834315397", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tprint(out)\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nif 0 <= out and out <= max then\n\twhile true do\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s225420836", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tprint(out)\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nif not (0 <= out and out <= max) then\n\twhile true do\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590984127, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s225420836.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s225420836", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tprint(out)\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nif not (0 <= out and out <= max) then\n\twhile true do\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 2205, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s686005486", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\telse\n\t\t\twhile true do\n\t\t\t\tout = 0\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590983542, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s686005486.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s686005486", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\telse\n\t\t\twhile true do\n\t\t\t\tout = 0\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 2205, "memory_kb": 2440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s073979561", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\twhile true do\n\t\t\tout = -1\n\t\tend\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590983361, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s073979561.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s073979561", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\twhile true do\n\t\t\tout = -1\n\t\tend\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s743793574", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\t\twhile true do\n\t\t\t\tout = -1\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590983204, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s743793574.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s743793574", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\t\twhile true do\n\t\t\t\tout = -1\n\t\t\tend\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s429877737", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590981958, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s429877737.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s429877737", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 29, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s941390826", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000 * 1000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590981765, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s941390826.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s941390826", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 1000000000 * 1000000000\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820112761", "group_id": "codeNet:p02658", "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 N = read.n()\nlocal A = read.N(N)\nlocal p = 1\nlocal ov = false\nfor i=1,N do\n    if A[i] == 0 then\n        print(0)\n        return\n    end\n    local np = p * A[i]\n    if math.log(p, 10) + math.log(A[i], 10) > 18 then\n        ov = true\n    end\n    if np > 10^18 then\n        ov = true\n    end\n    p = np\nend\nif ov then\n    print(-1)\nelse\n    print(p)\nend", "language": "Lua", "metadata": {"date": 1590981117, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s820112761.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820112761", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1000000000000000000\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 N = read.n()\nlocal A = read.N(N)\nlocal p = 1\nlocal ov = false\nfor i=1,N do\n    if A[i] == 0 then\n        print(0)\n        return\n    end\n    local np = p * A[i]\n    if math.log(p, 10) + math.log(A[i], 10) > 18 then\n        ov = true\n    end\n    if np > 10^18 then\n        ov = true\n    end\n    p = np\nend\nif ov then\n    print(-1)\nelse\n    print(p)\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 140, "memory_kb": 12704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361901576", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 10^18\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590978964, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s361901576.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361901576", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 10^18\n\nlocal out = 1\nfor _i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif not (0 <= out and out <= max) then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 2788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s891942294", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif out < 0 or max < out then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590978345, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s891942294.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s891942294", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal max = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tlocal num = read(\"n\")\n\tif num == 0 then\n\t\tout = 0\n\t\tbreak\n\tend\n\tif out > 0 then\n\t\tout = out * num\n\t\tif out < 0 or max < out then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 27, "memory_kb": 2776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s100174102", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tlocal num = read(\"n\")\n\tif out < 0 and num == 0 then\n\t\tout = 0\n\t\tbreak\n\telse\n\t\tout = out * num\n\t\tif out < 0 or inf < out then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590977828, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s100174102.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s100174102", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tlocal num = read(\"n\")\n\tif out < 0 and num == 0 then\n\t\tout = 0\n\t\tbreak\n\telse\n\t\tout = out * num\n\t\tif out < 0 or inf < out then\n\t\t\tout = -1\n\t\tend\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s486880939", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tif out < 0 then\n\t\tlocal preZ = read(\"n\")\n\t\tif preZ == 0 then\n\t\t\tout = 0\n\t\t\tbreak\n\t\tend\n\telse\n\t\tout = out * read(\"n\")\n\tend\n\tif out < 0 or inf < out then\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590974917, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s486880939.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s486880939", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tif out < 0 then\n\t\tlocal preZ = read(\"n\")\n\t\tif preZ == 0 then\n\t\t\tout = 0\n\t\t\tbreak\n\t\tend\n\telse\n\t\tout = out * read(\"n\")\n\tend\n\tif out < 0 or inf < out then\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s314335517", "group_id": "codeNet:p02658", "input_text": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tif out < 0 then\n\t\tlocal preZ = read(\"n\")\n\t\tif preZ == 0 then\n\t\t\tout = 0\n\t\t\tbreak\n\t\tend\n\telse\n\t\tout = out * read(\"n\")\n\tend\n\tif out > inf then\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1590974233, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s314335517.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s314335517", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "local read = io.read\nlocal N = read(\"n\")\nlocal inf = 10^18\n\nlocal out = 1\nfor i = 1, N do\n\tif out < 0 then\n\t\tlocal preZ = read(\"n\")\n\t\tif preZ == 0 then\n\t\t\tout = 0\n\t\t\tbreak\n\t\tend\n\telse\n\t\tout = out * read(\"n\")\n\tend\n\tif out > inf then\n\t\tout = -1\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s494708120", "group_id": "codeNet:p02658", "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 N = read.n()\nlocal A = read.N(N)\nlocal p = 1\nlocal ov = false\nfor i=1,N do\n    if A[i] == 0 then\n        print(0)\n        return\n    end\n    local np = p * A[i]\n    if np > 10^18 then\n        ov = true\n    end\n    p = np\nend\nif ov then\n    print(-1)\nelse\n    print(p)\nend", "language": "Lua", "metadata": {"date": 1590973434, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s494708120.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s494708120", "user_id": "u162773977"}, "prompt_components": {"gold_output": "1000000000000000000\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 N = read.n()\nlocal A = read.N(N)\nlocal p = 1\nlocal ov = false\nfor i=1,N do\n    if A[i] == 0 then\n        print(0)\n        return\n    end\n    local np = p * A[i]\n    if np > 10^18 then\n        ov = true\n    end\n    p = np\nend\nif ov then\n    print(-1)\nelse\n    print(p)\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1148, "cpu_time_ms": 132, "memory_kb": 12684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s036601963", "group_id": "codeNet:p02658", "input_text": "n = io.read(\"*n\")\nt = 1\na = {}\nhaszero = false\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  if a[i] == 0 then haszero = true end\nend\nif haszero then\n  print(0)\n  os.exit()\nend\nfor i = 1, n do\n  local lim = (1000000000 * 1000000000) // t\n  if lim < a[i] then\n    t = -1\n    break\n  end\n  t = t * a[i]\nend\nprint(t)\n", "language": "Lua", "metadata": {"date": 1590973408, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lua/s036601963.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s036601963", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "n = io.read(\"*n\")\nt = 1\na = {}\nhaszero = false\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  if a[i] == 0 then haszero = true end\nend\nif haszero then\n  print(0)\n  os.exit()\nend\nfor i = 1, n do\n  local lim = (1000000000 * 1000000000) // t\n  if lim < a[i] then\n    t = -1\n    break\n  end\n  t = t * a[i]\nend\nprint(t)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\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\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 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 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 4844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s122953310", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100 + 0.5)\n\nlocal int = math.floor(A * B)\nprint(int // 100)\n", "language": "Lua", "metadata": {"date": 1593183027, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s122953310.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s122953310", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100 + 0.5)\n\nlocal int = math.floor(A * B)\nprint(int // 100)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s376841798", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B + 0.5)\n\nlocal int = math.floor(A * B)\nprint(int)\n", "language": "Lua", "metadata": {"date": 1593182881, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s376841798.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s376841798", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B + 0.5)\n\nlocal int = math.floor(A * B)\nprint(int)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 10, "memory_kb": 2708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s566712563", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor((B + 0.5) * 100)\n\nlocal int = math.floor(A * B)\nprint(int // 100)\n", "language": "Lua", "metadata": {"date": 1593182743, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s566712563.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s566712563", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor((B + 0.5) * 100)\n\nlocal int = math.floor(A * B)\nprint(int // 100)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 5, "memory_kb": 2740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s415917437", "group_id": "codeNet:p02659", "input_text": "local a=io.read(\"n\")\nlocal b=io.read():gsub(\" \",\"\")\nb=b:sub(1,1)..b:sub(3)\nb=tonumber(b)\nprint(a*b//100)", "language": "Lua", "metadata": {"date": 1592969089, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s415917437.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415917437", "user_id": "u045238009"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local a=io.read(\"n\")\nlocal b=io.read():gsub(\" \",\"\")\nb=b:sub(1,1)..b:sub(3)\nb=tonumber(b)\nprint(a*b//100)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s023593802", "group_id": "codeNet:p02659", "input_text": "local a,b=io.read(\"n\",\"n\")\nlocal answer=math.modf(a*b)\nprint(answer)", "language": "Lua", "metadata": {"date": 1592968785, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s023593802.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s023593802", "user_id": "u045238009"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local a,b=io.read(\"n\",\"n\")\nlocal answer=math.modf(a*b)\nprint(answer)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s399837962", "group_id": "codeNet:p02659", "input_text": "local a,b=io.read(\"n\",\"n\")\nprint(math.floor(a*b))", "language": "Lua", "metadata": {"date": 1592966477, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s399837962.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399837962", "user_id": "u045238009"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local a,b=io.read(\"n\",\"n\")\nprint(math.floor(a*b))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s562896177", "group_id": "codeNet:p02659", "input_text": "local a,b=io.read(\"n\",\"n\")\nb=100*b\nprint(string.format(\"%d\",a*b//100))", "language": "Lua", "metadata": {"date": 1592965678, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s562896177.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562896177", "user_id": "u045238009"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local a,b=io.read(\"n\",\"n\")\nb=100*b\nprint(string.format(\"%d\",a*b//100))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s059166454", "group_id": "codeNet:p02659", "input_text": "print(math.floor(io.read(\"*n\")*io.read(\"*n\")))", "language": "Lua", "metadata": {"date": 1590981117, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s059166454.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s059166454", "user_id": "u000698877"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "print(math.floor(io.read(\"*n\")*io.read(\"*n\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s950797699", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100)\n\nlocal int = math.floor(A * B)\nprint(int//100)\n", "language": "Lua", "metadata": {"date": 1590980820, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s950797699.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s950797699", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100)\n\nlocal int = math.floor(A * B)\nprint(int//100)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s803670797", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100)\nprint(B)\n\nlocal int = math.floor(A * B)\nprint(int//100)\n", "language": "Lua", "metadata": {"date": 1590980200, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s803670797.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s803670797", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nB = math.floor(B * 100)\nprint(B)\n\nlocal int = math.floor(A * B)\nprint(int//100)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s229398794", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nlocal int = math.modf(A * B)\n\nprint(int)\n", "language": "Lua", "metadata": {"date": 1590978553, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s229398794.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s229398794", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nlocal int = math.modf(A * B)\n\nprint(int)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678443749", "group_id": "codeNet:p02659", "input_text": "local A, B = io.read(\"n\", \"n\")\n\nprint(math.floor(A * B))\n", "language": "Lua", "metadata": {"date": 1590974408, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s678443749.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s678443749", "user_id": "u793881115"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "local A, B = io.read(\"n\", \"n\")\n\nprint(math.floor(A * B))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 4, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s619859355", "group_id": "codeNet:p02659", "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, B = read.l():split()\nA = tonumber(A)\nB = B:totable()\nlocal B100 = tonumber(B[1]) * 100 + tonumber(B[3]) * 10 + tonumber(B[4])\nlocal P100 = A * B100\nlocal s = tostring(P100)\nif #s <= 2 then\n    print(0)\nelse\n    print(s:sub(1,#s-2))\nend", "language": "Lua", "metadata": {"date": 1590974374, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s619859355.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619859355", "user_id": "u162773977"}, "prompt_components": {"gold_output": "217\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, B = read.l():split()\nA = tonumber(A)\nB = B:totable()\nlocal B100 = tonumber(B[1]) * 100 + tonumber(B[3]) * 10 + tonumber(B[4])\nlocal P100 = A * B100\nlocal s = tostring(P100)\nif #s <= 2 then\n    print(0)\nelse\n    print(s:sub(1,#s-2))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1115, "cpu_time_ms": 8, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s591167349", "group_id": "codeNet:p02659", "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, B = read.nn()\nprint(math.floor(A*B))", "language": "Lua", "metadata": {"date": 1590973942, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s591167349.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s591167349", "user_id": "u162773977"}, "prompt_components": {"gold_output": "217\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, B = read.nn()\nprint(math.floor(A*B))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 916, "cpu_time_ms": 7, "memory_kb": 2736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s605245739", "group_id": "codeNet:p02659", "input_text": "s = io.read()\na, b, c = s:match(\"(%d+) (%d+)%.(%d%d)\")\na, b, c = math.floor(a), math.floor(b), math.floor(c)\nd = a * (b * 100 + c)\nprint(d // 100)\n", "language": "Lua", "metadata": {"date": 1590973613, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lua/s605245739.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605245739", "user_id": "u120582723"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "s = io.read()\na, b, c = s:match(\"(%d+) (%d+)%.(%d%d)\")\na, b, c = math.floor(a), math.floor(b), math.floor(c)\nd = a * (b * 100 + c)\nprint(d // 100)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 5, "memory_kb": 2732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s483791162", "group_id": "codeNet:p02684", "input_text": "\nlocal n = io.read(\"*n\")\nlocal k = io.read(\"*n\")\nlocal tbA = {}\nfor i = 1,n do\n    table.insert(tbA,io.read(\"*n\"))\nend\nio.read()\n\nfunction isNumInTb(num,tb)\n    for k,v in ipairs(tb) do\n        if v == num then\n            return k\n        end\n    end\n    return 0\nend\n\n-- function print_tb(tb)\n--     for k,v in ipairs(tb) do\n--         print(v..\" \")\n--     end\n-- end\n\nlocal new_tb = {}\nlocal new_new_tb = {}\nlocal idx = 0\n\nlocal i = 1\nwhile tbA[i] do\n    if isNumInTb(i,new_tb) > 0 then\n        \n        local j = isNumInTb(i,new_tb)\n        idx = isNumInTb(i,new_tb)\n        for m=idx,#new_tb do\n            table.insert(new_new_tb,new_tb[m])\n            j = j + 1\n        end\n        break\n    else\n        table.insert(new_tb,i)\n        i = tbA[i]\n    end\nend\nk = k - idx + 1\nlocal numTb = #new_new_tb\n\nlocal kk = math.mod(k,numTb)\nif kk==0 then kk = kk + numTb end\nprint(tbA[new_new_tb[kk]])\n\n-- for i = 1, string.len(a) do\n--     table.insert(b,string.sub(a,i,i))\n-- end\n", "language": "Lua", "metadata": {"date": 1594436978, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s483791162.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s483791162", "user_id": "u863370423"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nlocal n = io.read(\"*n\")\nlocal k = io.read(\"*n\")\nlocal tbA = {}\nfor i = 1,n do\n    table.insert(tbA,io.read(\"*n\"))\nend\nio.read()\n\nfunction isNumInTb(num,tb)\n    for k,v in ipairs(tb) do\n        if v == num then\n            return k\n        end\n    end\n    return 0\nend\n\n-- function print_tb(tb)\n--     for k,v in ipairs(tb) do\n--         print(v..\" \")\n--     end\n-- end\n\nlocal new_tb = {}\nlocal new_new_tb = {}\nlocal idx = 0\n\nlocal i = 1\nwhile tbA[i] do\n    if isNumInTb(i,new_tb) > 0 then\n        \n        local j = isNumInTb(i,new_tb)\n        idx = isNumInTb(i,new_tb)\n        for m=idx,#new_tb do\n            table.insert(new_new_tb,new_tb[m])\n            j = j + 1\n        end\n        break\n    else\n        table.insert(new_tb,i)\n        i = tbA[i]\n    end\nend\nk = k - idx + 1\nlocal numTb = #new_new_tb\n\nlocal kk = math.mod(k,numTb)\nif kk==0 then kk = kk + numTb end\nprint(tbA[new_new_tb[kk]])\n\n-- for i = 1, string.len(a) do\n--     table.insert(b,string.sub(a,i,i))\n-- end\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 6836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s869690935", "group_id": "codeNet:p02684", "input_text": "\nlocal n = io.read(\"*n\")\nlocal k = io.read(\"*n\")\nlocal tbA = {}\nfor i = 1,n do\n    table.insert(tbA,io.read(\"*n\"))\nend\n\nfunction isNumInTb(num,tb)\n    for k,v in ipairs(tb) do\n        if v == num then\n            return k\n        end\n    end\n    return 0\nend\n\n-- function print_tb(tb)\n--     for k,v in ipairs(tb) do\n--         print(v..\" \")\n--     end\n-- end\n\nlocal new_tb = {}\nlocal new_new_tb = {}\nlocal idx = 0\n\nlocal i = 1\nwhile tbA[i] do\n    if isNumInTb(i,new_tb) > 0 then\n        \n        local j = isNumInTb(i,new_tb)\n        idx = isNumInTb(i,new_tb)\n        for m=idx,#new_tb do\n            table.insert(new_new_tb,new_tb[m])\n            j = j + 1\n        end\n        break\n    else\n        table.insert(new_tb,i)\n        i = tbA[i]\n    end\nend\nk = k - idx + 1\nlocal numTb = #new_new_tb\n\nlocal kk = math.mod(k,numTb)\nif kk==0 then kk = kk + numTb end\nprint(tbA[new_new_tb[kk]])\n\n-- for i = 1, string.len(a) do\n--     table.insert(b,string.sub(a,i,i))\n-- end\n", "language": "Lua", "metadata": {"date": 1594436888, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s869690935.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s869690935", "user_id": "u353919145"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nlocal n = io.read(\"*n\")\nlocal k = io.read(\"*n\")\nlocal tbA = {}\nfor i = 1,n do\n    table.insert(tbA,io.read(\"*n\"))\nend\n\nfunction isNumInTb(num,tb)\n    for k,v in ipairs(tb) do\n        if v == num then\n            return k\n        end\n    end\n    return 0\nend\n\n-- function print_tb(tb)\n--     for k,v in ipairs(tb) do\n--         print(v..\" \")\n--     end\n-- end\n\nlocal new_tb = {}\nlocal new_new_tb = {}\nlocal idx = 0\n\nlocal i = 1\nwhile tbA[i] do\n    if isNumInTb(i,new_tb) > 0 then\n        \n        local j = isNumInTb(i,new_tb)\n        idx = isNumInTb(i,new_tb)\n        for m=idx,#new_tb do\n            table.insert(new_new_tb,new_tb[m])\n            j = j + 1\n        end\n        break\n    else\n        table.insert(new_tb,i)\n        i = tbA[i]\n    end\nend\nk = k - idx + 1\nlocal numTb = #new_new_tb\n\nlocal kk = math.mod(k,numTb)\nif kk==0 then kk = kk + numTb end\nprint(tbA[new_new_tb[kk]])\n\n-- for i = 1, string.len(a) do\n--     table.insert(b,string.sub(a,i,i))\n-- end\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 969, "cpu_time_ms": 2205, "memory_kb": 6828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s284977327", "group_id": "codeNet:p02684", "input_text": "local n = io.read(\"*n\")\nlocal k = io.read(\"*n\"\n)\nio.read(\"*l\")\nlocal towns = {}\nfor i = 1, n do \n\ttowns[i] = io.read(\"*n\")\nend\nio.read(\"*l\")\nlocal visited = {}\nlocal step = 1\nlocal idx = 1\nlocal period\nlocal periodstart\nlocal steps = {}\nwhile(step <= k) do \n\tif visited[towns[idx]] then\n\t\tperiod = step - visited[towns[idx]]\n\t\tperiodstart = visited[towns[idx]]\n\t\tbreak\n\tend\n\tvisited[towns[idx]] = step\n\tsteps[step] = towns[idx]\n\tidx = towns[idx]\n\tstep = step + 1\nend\nif period then \n\tlocal resttimes = k - step\n\tresttimes = resttimes % period\n\tprint(steps[periodstart + resttimes])\nelse\n\tprint(idx)\nend", "language": "Lua", "metadata": {"date": 1594432961, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s284977327.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284977327", "user_id": "u353919145"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal k = io.read(\"*n\"\n)\nio.read(\"*l\")\nlocal towns = {}\nfor i = 1, n do \n\ttowns[i] = io.read(\"*n\")\nend\nio.read(\"*l\")\nlocal visited = {}\nlocal step = 1\nlocal idx = 1\nlocal period\nlocal periodstart\nlocal steps = {}\nwhile(step <= k) do \n\tif visited[towns[idx]] then\n\t\tperiod = step - visited[towns[idx]]\n\t\tperiodstart = visited[towns[idx]]\n\t\tbreak\n\tend\n\tvisited[towns[idx]] = step\n\tsteps[step] = towns[idx]\n\tidx = towns[idx]\n\tstep = step + 1\nend\nif period then \n\tlocal resttimes = k - step\n\tresttimes = resttimes % period\n\tprint(steps[periodstart + resttimes])\nelse\n\tprint(idx)\nend", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 602, "cpu_time_ms": 90, "memory_kb": 20672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s856070059", "group_id": "codeNet:p02684", "input_text": "n,k=io.read(\"*n\",\"*n\")\np=1 a={} b={} for i=1,n do a[i]=io.read(\"*n\") b[i]=0 end\nwhile 0<k do if k%2==1 then p=a[p] end k=k//2\nfor i=1,n do b[i]=a[a[i]] end\nfor i=1,n do a[i]=b[i] end\nend print(p)", "language": "Lua", "metadata": {"date": 1589478286, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s856070059.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856070059", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\")\np=1 a={} b={} for i=1,n do a[i]=io.read(\"*n\") b[i]=0 end\nwhile 0<k do if k%2==1 then p=a[p] end k=k//2\nfor i=1,n do b[i]=a[a[i]] end\nfor i=1,n do a[i]=b[i] end\nend print(p)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1145, "memory_kb": 10636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s594130930", "group_id": "codeNet:p02684", "input_text": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\npath={1}\nvisited={}\nposition=1\nfor i=1,n do\n    table.insert(path,a[position])\n    if not visited[position] then\n        visited[position]=true\n    else\n        break\n    end\n    if i==k then\n        print(a[position])\n        return\n    end\n    position=a[position]\nend\n\nloop=0\ndistance=0\nfor i=1,#path do\n    if path[i]==a[position] then\n        loop=#path-i\n        distance=i-2\n        break\n    end\nend\n\nx=(k-distance)%loop\nfor i=1,x do\n    position=a[position]\nend\nprint(position)", "language": "Lua", "metadata": {"date": 1589325831, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s594130930.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594130930", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\npath={1}\nvisited={}\nposition=1\nfor i=1,n do\n    table.insert(path,a[position])\n    if not visited[position] then\n        visited[position]=true\n    else\n        break\n    end\n    if i==k then\n        print(a[position])\n        return\n    end\n    position=a[position]\nend\n\nloop=0\ndistance=0\nfor i=1,#path do\n    if path[i]==a[position] then\n        loop=#path-i\n        distance=i-2\n        break\n    end\nend\n\nx=(k-distance)%loop\nfor i=1,x do\n    position=a[position]\nend\nprint(position)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 560, "cpu_time_ms": 124, "memory_kb": 18944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s822912687", "group_id": "codeNet:p02684", "input_text": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\npath={1}\nvisited={}\nposition=1\nfor i=1,n do\n    table.insert(path,a[position])\n    if not visited[position] then\n        visited[position]=true\n    else\n        break\n    end\n    position=a[position]\nend\n\nloop=0\ndistance=0\nfor i=1,#path do\n    if path[i]==a[position] then\n        loop=#path-i\n        distance=i-2\n        break\n    end\nend\n\nx=(k-distance)%loop\nfor i=1,x do\n    position=a[position]\nend\nprint(position)", "language": "Lua", "metadata": {"date": 1589325656, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s822912687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s822912687", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\npath={1}\nvisited={}\nposition=1\nfor i=1,n do\n    table.insert(path,a[position])\n    if not visited[position] then\n        visited[position]=true\n    else\n        break\n    end\n    position=a[position]\nend\n\nloop=0\ndistance=0\nfor i=1,#path do\n    if path[i]==a[position] then\n        loop=#path-i\n        distance=i-2\n        break\n    end\nend\n\nx=(k-distance)%loop\nfor i=1,x do\n    position=a[position]\nend\nprint(position)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 137, "memory_kb": 18976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s929438147", "group_id": "codeNet:p02684", "input_text": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nt={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "language": "Lua", "metadata": {"date": 1589308454, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s929438147.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s929438147", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nt={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 63, "memory_kb": 10260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s201991046", "group_id": "codeNet:p02684", "input_text": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nt={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "language": "Lua", "metadata": {"date": 1589308405, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s201991046.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s201991046", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "n,k=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nt={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 19772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s061291280", "group_id": "codeNet:p02684", "input_text": "t={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "language": "Lua", "metadata": {"date": 1589308369, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s061291280.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s061291280", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "t={true}\ns={}\nfor i=1,n do\n    if not t[a[i]] then\n        t[a[i]]=true\n    else\n        s={a[i],i}\n    end\nend\n\nx=1\ny=1\nfor i=1,n do\n    if a[i]==s[1] then\n        x=i\n        y=s[2]-i\n        break\n    end\nend\nprint(y>0 and a[x+(k-x)%y] or x)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s117182187", "group_id": "codeNet:p02684", "input_text": "local N = io.read(\"*n\")\nlocal K = io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal last_times = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\n\tlocal last_time = last_times[town]\n\tif last_time ~= nil then\n\t\tlocal loop_times = times - last_time\n\t\tlocal K_in_loop = K - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\tlast_times[town] = times\n\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "language": "Lua", "metadata": {"date": 1589229019, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s117182187.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117182187", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal K = io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal last_times = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\n\tlocal last_time = last_times[town]\n\tif last_time ~= nil then\n\t\tlocal loop_times = times - last_time\n\t\tlocal K_in_loop = K - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\tlast_times[town] = times\n\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 79, "memory_kb": 14640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s312339049", "group_id": "codeNet:p02684", "input_text": "local N = io.read(\"*n\")\nlocal K = io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tprint(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal last_times = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\n\tlocal last_time = last_times[town]\n\tif last_time ~= nil then\n\t\tlocal loop_times = times - last_time\n\t\tlocal K_in_loop = K - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\tlast_times[town] = times\n\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "language": "Lua", "metadata": {"date": 1589228932, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s312339049.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s312339049", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal K = io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tprint(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal last_times = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\n\tlocal last_time = last_times[town]\n\tif last_time ~= nil then\n\t\tlocal loop_times = times - last_time\n\t\tlocal K_in_loop = K - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\tlast_times[town] = times\n\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 667, "cpu_time_ms": 156, "memory_kb": 14652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s701215256", "group_id": "codeNet:p02684", "input_text": "local N = io.read(\"*n\")\nlocal K = 0LL + io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal have_comes = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\tlocal last_time = have_comes[town]\n\tif last_time ~= nil then\n\t\tlocal K_in_loop = K - last_time\n\t\tlocal loop_times = times - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\thave_comes[town] = times\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "language": "Lua", "metadata": {"date": 1589202538, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s701215256.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s701215256", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal K = 0LL + io.read(\"*n\")\n\nlocal A = {}\nfor i = 1, N do\n\tA[i] = io.read(\"*n\")\nend\n\nlocal function goToK(town, rem_times)\n\tif rem_times <= 0 then\n\t\treturn town\n\telse\n\t\treturn goToK(A[town], rem_times - 1)\n\tend\nend\n\nlocal have_comes = {}\nlocal function teleport(town, times)\n\tif times == K then\n\t\treturn town\n\tend\n\tlocal last_time = have_comes[town]\n\tif last_time ~= nil then\n\t\tlocal K_in_loop = K - last_time\n\t\tlocal loop_times = times - last_time\n\t\tK_in_loop = K_in_loop % loop_times\n\t\treturn goToK(town, K_in_loop)\n\telse\n\t\thave_comes[town] = times\n\t\treturn teleport(A[town], times + 1)\n\tend\nend\n\nprint(teleport(1, 0))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 646, "cpu_time_ms": 57, "memory_kb": 8300}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s232138355", "group_id": "codeNet:p02684", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n\nD={[0]=A}\nfor i=1,math.log(K)/math.log(2) do\n\tD[i]={}\n\tfor j=1,N do\n\t\tD[i][j]=D[i-1][D[i-1][j]]\n\tend\nend\n\nlocal a=1\nfor i=0,math.log(K)/math.log(2)do\n\tif((K>>i)&1~=0)then\n\t\ta=D[i][a]\n\tend\nend\nprint(a)", "language": "Lua", "metadata": {"date": 1589185980, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s232138355.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232138355", "user_id": "u726173718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n\nD={[0]=A}\nfor i=1,math.log(K)/math.log(2) do\n\tD[i]={}\n\tfor j=1,N do\n\t\tD[i][j]=D[i-1][D[i-1][j]]\n\tend\nend\n\nlocal a=1\nfor i=0,math.log(K)/math.log(2)do\n\tif((K>>i)&1~=0)then\n\t\ta=D[i][a]\n\tend\nend\nprint(a)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1578, "memory_kb": 248496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s827690949", "group_id": "codeNet:p02684", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n \nB={[1]=0}\nC={[0]=1}\nfor i=1,math.min(N,K) do\n\tC[i]=A[C[i-1]]\n\tif(B[C[i]])then\n\t\tlocal j=B[C[i]]\n\t\tprint(C[j+(K-j)%(i-j)])\n\t\treturn\n\tend\n\tB[C[i]]=i\nend\nprint(C[K])", "language": "Lua", "metadata": {"date": 1589182729, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s827690949.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s827690949", "user_id": "u726173718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n \nB={[1]=0}\nC={[0]=1}\nfor i=1,math.min(N,K) do\n\tC[i]=A[C[i-1]]\n\tif(B[C[i]])then\n\t\tlocal j=B[C[i]]\n\t\tprint(C[j+(K-j)%(i-j)])\n\t\treturn\n\tend\n\tB[C[i]]=i\nend\nprint(C[K])", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 232, "cpu_time_ms": 55, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s063955972", "group_id": "codeNet:p02684", "input_text": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n\nlocal function count(t)local r=0 for _,_ in pairs(t)do r=r+1 end return r end\n\nB={[1]=0}\nC={[0]=1}\nfor i=1,math.min(N,K) do\n\tC[i]=A[C[i-1]]\n\tif(B[C[i]])then\n\t\tt=C[i]\n\t\tfor j=i-1,1,-1 do\n\t\t\tif(C[j]==t)then\n\t\t\t\tprint(C[j+(K-j)%(i-j)])\n\t\t\t\treturn\n\t\t\tend\n\t\tend\n\tend\n\tB[C[i]]=0\nend\nprint(C[K])", "language": "Lua", "metadata": {"date": 1589161592, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s063955972.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s063955972", "user_id": "u726173718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "N=io.read\"*n\"\nK=io.read\"*n\"\nA={}\nfor i=1,N do\n\tA[i]=io.read\"*n\"\nend\n\nlocal function count(t)local r=0 for _,_ in pairs(t)do r=r+1 end return r end\n\nB={[1]=0}\nC={[0]=1}\nfor i=1,math.min(N,K) do\n\tC[i]=A[C[i-1]]\n\tif(B[C[i]])then\n\t\tt=C[i]\n\t\tfor j=i-1,1,-1 do\n\t\t\tif(C[j]==t)then\n\t\t\t\tprint(C[j+(K-j)%(i-j)])\n\t\t\t\treturn\n\t\t\tend\n\t\tend\n\tend\n\tB[C[i]]=0\nend\nprint(C[K])", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 61, "memory_kb": 9232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s411891838", "group_id": "codeNet:p02684", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal map = {}\nlocal len = 0\nmap[1] = 0\nlocal src = 1\nlocal rem = 0\nwhile true do\n  len = len + 1\n  local dst = a[src]\n  if len == k then\n    print(dst)\n    os.exit()\n  end\n  if map[dst] then\n    local offset = map[dst]\n    local loopSize = len - offset\n    rem = k - offset\n    rem = rem % loopSize\n    src = dst\n    break\n  else\n    map[dst] = len\n  end\n  src = dst\nend\nfor i = 1, rem do\n  local dst = a[src]\n  src = dst\nend\nprint(src)\n", "language": "Lua", "metadata": {"date": 1589159683, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lua/s411891838.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411891838", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\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\nlocal map = {}\nlocal len = 0\nmap[1] = 0\nlocal src = 1\nlocal rem = 0\nwhile true do\n  len = len + 1\n  local dst = a[src]\n  if len == k then\n    print(dst)\n    os.exit()\n  end\n  if map[dst] then\n    local offset = map[dst]\n    local loopSize = len - offset\n    rem = k - offset\n    rem = rem % loopSize\n    src = dst\n    break\n  else\n    map[dst] = len\n  end\n  src = dst\nend\nfor i = 1, rem do\n  local dst = a[src]\n  src = dst\nend\nprint(src)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 77, "memory_kb": 14724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s142529069", "group_id": "codeNet:p02700", "input_text": "local a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nwhile true do\n    c=c-b\n    if c<=0 then\n        print(\"Yes\")\n        return\n    end\n    a=a-d\n    if a<=0 then\n        print(\"No\")\n        return\n    end\nend", "language": "Lua", "metadata": {"date": 1594175692, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s142529069.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s142529069", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nwhile true do\n    c=c-b\n    if c<=0 then\n        print(\"Yes\")\n        return\n    end\n    a=a-d\n    if a<=0 then\n        print(\"No\")\n        return\n    end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s955462432", "group_id": "codeNet:p02700", "input_text": "local a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nwhile a>0 or c>0 do\n    c=c-b\n    a=a-d\nend\nif a<=0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1594175595, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s955462432.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s955462432", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local a,b,c,d=io.read(\"n\",\"n\",\"n\",\"n\")\nwhile a>0 or c>0 do\n    c=c-b\n    a=a-d\nend\nif a<=0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s151969635", "group_id": "codeNet:p02700", "input_text": "a, b = io.read(\"*n\", \"*n\")\nc, d = io.read(\"*n\", \"*n\")\n\ne = math.ceil(c / b)\nf = math.ceil(a / d)\n\nprint(e <= f and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589041865, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s151969635.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151969635", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nc, d = io.read(\"*n\", \"*n\")\n\ne = math.ceil(c / b)\nf = math.ceil(a / d)\n\nprint(e <= f and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s268399830", "group_id": "codeNet:p02700", "input_text": "A,B,C,D=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nflag=true\n\nwhile flag do\n  if C>B then C=C-B\n  else\n    print(\"Yes\")\n    flag=false\n    break\n  end\n  if A>D then A=A-D\n  else\n    print(\"No\")\n    flag=false\n  end\nend", "language": "Lua", "metadata": {"date": 1587955573, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s268399830.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s268399830", "user_id": "u000698877"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "A,B,C,D=io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nflag=true\n\nwhile flag do\n  if C>B then C=C-B\n  else\n    print(\"Yes\")\n    flag=false\n    break\n  end\n  if A>D then A=A-D\n  else\n    print(\"No\")\n    flag=false\n  end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s288818836", "group_id": "codeNet:p02700", "input_text": "local m1_hp, m1_at, m2_hp, m2_at = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n\nwhile true do\n\tm2_hp = m2_hp - m1_at\n\tif m2_hp <= 0 then\n\t\tprint(\"Yes\")\n\t\tbreak\n\tend\n\n\tm1_hp = m1_hp - m2_at\n\tif m1_hp <= 0 then\n\t\tprint(\"No\")\n\t\tbreak\n\tend\nend", "language": "Lua", "metadata": {"date": 1587949917, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s288818836.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288818836", "user_id": "u793881115"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local m1_hp, m1_at, m2_hp, m2_at = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n\nwhile true do\n\tm2_hp = m2_hp - m1_at\n\tif m2_hp <= 0 then\n\t\tprint(\"Yes\")\n\t\tbreak\n\tend\n\n\tm1_hp = m1_hp - m2_at\n\tif m1_hp <= 0 then\n\t\tprint(\"No\")\n\t\tbreak\n\tend\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s424136464", "group_id": "codeNet:p02700", "input_text": "A=io.read\"*n\"\nB=io.read\"*n\"\nC=io.read\"*n\"\nD=io.read\"*n\"\n\nprint((\n\tmath.ceil(C/B)<=math.ceil(A/D)\n)and\"Yes\"or\"No\")", "language": "Lua", "metadata": {"date": 1587949484, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s424136464.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424136464", "user_id": "u726173718"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "A=io.read\"*n\"\nB=io.read\"*n\"\nC=io.read\"*n\"\nD=io.read\"*n\"\n\nprint((\n\tmath.ceil(C/B)<=math.ceil(A/D)\n)and\"Yes\"or\"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 3, "memory_kb": 2744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s745382574", "group_id": "codeNet:p02700", "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 T_HP, T_ATK, A_HP, A_ATK = read.nnnn()\nlocal taka = true\nwhile T_HP > 0 and A_HP > 0 do\n    if taka then\n        A_HP = A_HP - T_ATK\n    else\n        T_HP = T_HP - A_ATK\n    end\n    taka = not taka\nend\nif T_HP <= 0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend\n", "language": "Lua", "metadata": {"date": 1587949435, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s745382574.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s745382574", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No\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 T_HP, T_ATK, A_HP, A_ATK = read.nnnn()\nlocal taka = true\nwhile T_HP > 0 and A_HP > 0 do\n    if taka then\n        A_HP = A_HP - T_ATK\n    else\n        T_HP = T_HP - A_ATK\n    end\n    taka = not taka\nend\nif T_HP <= 0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1139, "cpu_time_ms": 3, "memory_kb": 2640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s845247103", "group_id": "codeNet:p02700", "input_text": "local a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nwhile true do\n  if c <= b then\n    print(\"Yes\")\n    break\n  else\n    c = c - b\n  end\n  if a <= d then\n    print(\"No\")\n    break\n  else\n    a = a - d\n  end\nend\n", "language": "Lua", "metadata": {"date": 1587949340, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lua/s845247103.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845247103", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local a, b, c, d = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\nwhile true do\n  if c <= b then\n    print(\"Yes\")\n    break\n  else\n    c = c - b\n  end\n  if a <= d then\n    print(\"No\")\n    break\n  else\n    a = a - d\n  end\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\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 C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s981441207", "group_id": "codeNet:p02702", "input_text": "local s=io.read()\nlocal map={[0]=1}\nlocal digit=1\nlocal ms=0\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i,i))\n    ms=(ms+n*digit)%2019\n    map[ms]=(map[ms] or 0)+1\n    digit=(digit*10)%2019\nend\n\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1594177914, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s981441207.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981441207", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal map={[0]=1}\nlocal digit=1\nlocal ms=0\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i,i))\n    ms=(ms+n*digit)%2019\n    map[ms]=(map[ms] or 0)+1\n    digit=(digit*10)%2019\nend\n\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 53, "memory_kb": 2788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s548334680", "group_id": "codeNet:p02702", "input_text": "local s=io.read()\nlocal map={[0]=1}\nlocal digit=1\nlocal ms=0\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i,i))\n    local ms=(ms+n*digit)%2019\n    map[ms]=(map[ms] or 0)+1\n    digit=digit*10%2019\nend\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1594176918, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s548334680.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s548334680", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal map={[0]=1}\nlocal digit=1\nlocal ms=0\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i,i))\n    local ms=(ms+n*digit)%2019\n    map[ms]=(map[ms] or 0)+1\n    digit=digit*10%2019\nend\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 2696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s399715539", "group_id": "codeNet:p02702", "input_text": "local s=io.read()\nlocal map={[0]=1}\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i))\n    n=n%2019\n    map[n]=(map[n] or 0)+1\nend\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1594176315, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s399715539.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s399715539", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal map={[0]=1}\nfor i=#s,1,-1 do\n    local n=tonumber(s:sub(i))\n    n=n%2019\n    map[n]=(map[n] or 0)+1\nend\nlocal counter=0\nfor k,v in pairs(map) do\n    counter=counter+v*(v-1)//2\nend\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s719103308", "group_id": "codeNet:p02702", "input_text": "local s=io.read()\nlocal n=#s\nlocal p=2019\n\nlocal t={}\nfor i=1,p do\n    t[i]=(i==1 and 1 or 0)\nend\n\nlocal combination=0\nlocal digit=1\nlocal smod=0\nfor i=n,1,-1 do\n    local 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\nprint(combination)", "language": "Lua", "metadata": {"date": 1591747887, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s719103308.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719103308", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal n=#s\nlocal p=2019\n\nlocal t={}\nfor i=1,p do\n    t[i]=(i==1 and 1 or 0)\nend\n\nlocal combination=0\nlocal digit=1\nlocal smod=0\nfor i=n,1,-1 do\n    local 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\nprint(combination)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 2720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s052896199", "group_id": "codeNet:p02702", "input_text": "local s=io.read()\nlocal n=#s\nlocal p=2019\n\nlocal t={}\nfor i=1,p do\n    t[i]=(i==1 and 1 or 0)\nend\n\nlocal combination=0\nlocal digit=1\nlocal smod=0\nfor i=n,1,-1 do\n    local 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\nprint(combination)", "language": "Lua", "metadata": {"date": 1591719552, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s052896199.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052896199", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read()\nlocal n=#s\nlocal p=2019\n\nlocal t={}\nfor i=1,p do\n    t[i]=(i==1 and 1 or 0)\nend\n\nlocal combination=0\nlocal digit=1\nlocal smod=0\nfor i=n,1,-1 do\n    local 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\nprint(combination)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 50, "memory_kb": 2724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s752904273", "group_id": "codeNet:p02702", "input_text": "local s = io.read()\nlocal t = {}\nfor i = 1, 2019 do\n  t[i] = 0\nend\nt[2019] = 1\nlocal mul = 1\nlocal v = 0\nlocal ret = 0\nfor i = #s, 1, -1 do\n  v = v + mul * (s:sub(i, i):byte() - 48)\n  v = v % 2019\n  if v == 0 then\n    ret = ret + t[2019]\n    t[2019] = t[2019] + 1\n  else\n    ret = ret + t[v]\n    t[v] = t[v] + 1\n  end\n  mul = (mul * 10) % 2019\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589041652, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s752904273.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s752904273", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\nlocal t = {}\nfor i = 1, 2019 do\n  t[i] = 0\nend\nt[2019] = 1\nlocal mul = 1\nlocal v = 0\nlocal ret = 0\nfor i = #s, 1, -1 do\n  v = v + mul * (s:sub(i, i):byte() - 48)\n  v = v % 2019\n  if v == 0 then\n    ret = ret + t[2019]\n    t[2019] = t[2019] + 1\n  else\n    ret = ret + t[v]\n    t[v] = t[v] + 1\n  end\n  mul = (mul * 10) % 2019\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 54, "memory_kb": 2744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s443684321", "group_id": "codeNet:p02702", "input_text": "local MOD=2019\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 a<b and mul_(b,a)or mul_(a,b)\nend\nlocal function pow(a,b)\n\tlocal ret=1\n\twhile(b>0)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\nt={}\ns={0}\nwhile 1 do\n\tlocal a=io.read(1)\n\tif not(a)then break end\n\ttable.insert(t,tonumber(a))\n\ttable.insert(s,s[#s]+t[#t])\nend\nN=#t\n\ndp={[0]=0}\na={[0]=1}\nfor i=1,N do\n\tdp[i]=add(dp[i-1],mul(t[N-i+1],pow(10,i-1)))\n\tif(a[dp[i]])then\n\t\ta[dp[i]]=a[dp[i]]+1\n\telse\n\t\ta[dp[i]]=1\n\tend\nend\nc=0\nfor _,v in pairs(a)do\n\tc=c+v*(v-1)/2\nend\nprint(c)", "language": "Lua", "metadata": {"date": 1588250786, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s443684321.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443684321", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local MOD=2019\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 a<b and mul_(b,a)or mul_(a,b)\nend\nlocal function pow(a,b)\n\tlocal ret=1\n\twhile(b>0)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\nt={}\ns={0}\nwhile 1 do\n\tlocal a=io.read(1)\n\tif not(a)then break end\n\ttable.insert(t,tonumber(a))\n\ttable.insert(s,s[#s]+t[#t])\nend\nN=#t\n\ndp={[0]=0}\na={[0]=1}\nfor i=1,N do\n\tdp[i]=add(dp[i-1],mul(t[N-i+1],pow(10,i-1)))\n\tif(a[dp[i]])then\n\t\ta[dp[i]]=a[dp[i]]+1\n\telse\n\t\ta[dp[i]]=1\n\tend\nend\nc=0\nfor _,v in pairs(a)do\n\tc=c+v*(v-1)/2\nend\nprint(c)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 985, "cpu_time_ms": 645, "memory_kb": 8668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s476371462", "group_id": "codeNet:p02702", "input_text": "ans=0\nS=io.read(\"*l\")\nfor i=2019,200000,2019 do if string.find(S,i)~=nil then ans=ans+1 end end\nprint(ans)", "language": "Lua", "metadata": {"date": 1587956319, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s476371462.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s476371462", "user_id": "u000698877"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "ans=0\nS=io.read(\"*l\")\nfor i=2019,200000,2019 do if string.find(S,i)~=nil then ans=ans+1 end end\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 50, "memory_kb": 2744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s191881929", "group_id": "codeNet:p02702", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nlocal ten = 1\nfor i=1,N do\n    X[i] = ten * tonumber(S[i]) % 2019\n    ten = ten * 10 % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = math.floor((A[i-1] + X[i]) % 2019)\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    --print(i, A[i])\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1587955288, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s191881929.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s191881929", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nlocal ten = 1\nfor i=1,N do\n    X[i] = ten * tonumber(S[i]) % 2019\n    ten = ten * 10 % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = math.floor((A[i-1] + X[i]) % 2019)\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    --print(i, A[i])\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3081, "cpu_time_ms": 74, "memory_kb": 15368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s892498125", "group_id": "codeNet:p02702", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nlocal ten = 1\nfor i=1,N do\n    X[i] = ten * tonumber(S[i]) % 2019\n    ten = ten * 10 % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = math.floor((A[i-1] + X[i]) % 2019)\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    print(i, A[i])\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1587955251, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s892498125.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s892498125", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nlocal ten = 1\nfor i=1,N do\n    X[i] = ten * tonumber(S[i]) % 2019\n    ten = ten * 10 % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = math.floor((A[i-1] + X[i]) % 2019)\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    print(i, A[i])\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3079, "cpu_time_ms": 514, "memory_kb": 26556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s541594780", "group_id": "codeNet:p02702", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nfor i=1,N do\n    X[i] = math.floor(10^(i-1)) * tonumber(S[i]) % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = (A[i-1] + X[i]) % 2019\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1587954822, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s541594780.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s541594780", "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) 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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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 S = read.l():gsub(\"%s\", \"\"):reverse():totable()\nlocal N = #S\nlocal X = {}\nfor i=1,N do\n    X[i] = math.floor(10^(i-1)) * tonumber(S[i]) % 2019\nend\nlocal A = {}\nA[0] = 0\nfor i=1,N do\n    A[i] = (A[i-1] + X[i]) % 2019\nend\n--print(tostringxx(A))\nlocal set = {}\nfor i=0,N do\n    set[A[i]] = (set[A[i]] or 0) + 1\nend\n--print(tostringxx(set))\nlocal ans = 0\nfor k,v in pairs(set) do\n    ans = ans + v * (v - 1) // 2\nend\nprint(ans)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3025, "cpu_time_ms": 80, "memory_kb": 15996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s661481040", "group_id": "codeNet:p02702", "input_text": "t={}\ns={0}\nwhile 1 do\n\tlocal a=io.read(1)\n\tif not(a)then break end\n\ttable.insert(t,tonumber(a))\n\ttable.insert(s,s[#s]+t[#t])\nend\nN=#t\n\nr=0\nfor i=1,N do\nfor j=1,i-3 do\n\tif((s[i+1]-s[j])%3==0)then\n\t\tlocal n=0\n\t\tfor k=j,i do\n\t\t\tn=n*10+t[k]\n\t\tend\n\t\tif(n%673==0)then r=r+1 end\n\tend\nend\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1587950955, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s661481040.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s661481040", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "t={}\ns={0}\nwhile 1 do\n\tlocal a=io.read(1)\n\tif not(a)then break end\n\ttable.insert(t,tonumber(a))\n\ttable.insert(s,s[#s]+t[#t])\nend\nN=#t\n\nr=0\nfor i=1,N do\nfor j=1,i-3 do\n\tif((s[i+1]-s[j])%3==0)then\n\t\tlocal n=0\n\t\tfor k=j,i do\n\t\t\tn=n*10+t[k]\n\t\tend\n\t\tif(n%673==0)then r=r+1 end\n\tend\nend\nend\nprint(r)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 2205, "memory_kb": 6764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s189439165", "group_id": "codeNet:p02702", "input_text": "S=io.read()\nN=#S\nt={}\ns={0}\nfor i=1,N do\n\tt[i]=tonumber(S:sub(i,i))\n\ts[i+1]=s[i]+t[i]\nend\n\nr=0\nfor i=1,N do\nfor j=1,i-3 do\n\tif((s[i+1]-s[j])%3==0)then\n\t\tlocal n=0\n\t\tfor k=j,i do\n\t\t\tn=n*10+t[k]\n\t\tend\n\t\tif(n%673==0)then r=r+1 end\n\tend\nend\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1587950288, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s189439165.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s189439165", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "S=io.read()\nN=#S\nt={}\ns={0}\nfor i=1,N do\n\tt[i]=tonumber(S:sub(i,i))\n\ts[i+1]=s[i]+t[i]\nend\n\nr=0\nfor i=1,N do\nfor j=1,i-3 do\n\tif((s[i+1]-s[j])%3==0)then\n\t\tlocal n=0\n\t\tfor k=j,i do\n\t\t\tn=n*10+t[k]\n\t\tend\n\t\tif(n%673==0)then r=r+1 end\n\tend\nend\nend\nprint(r)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 7048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s772514170", "group_id": "codeNet:p02702", "input_text": "local s = io.read()\nlocal mul = 1\nlocal t = {}\nfor i = 0, 2018 do\n  t[i] = 0\nend\nt[0] = 1\nlocal cur = 0\nlocal ret = 0\nfor i = #s, 1, -1 do\n  local v = s:sub(i, i):byte() - 48\n  cur = (cur + mul * v) % 2019\n  ret = ret + t[cur]\n  t[cur] = t[cur] + 1\n  mul = (mul * 10) % 2019\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1587949689, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lua/s772514170.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772514170", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\nlocal mul = 1\nlocal t = {}\nfor i = 0, 2018 do\n  t[i] = 0\nend\nt[0] = 1\nlocal cur = 0\nlocal ret = 0\nfor i = #s, 1, -1 do\n  local v = s:sub(i, i):byte() - 48\n  cur = (cur + mul * v) % 2019\n  ret = ret + t[cur]\n  t[cur] = t[cur] + 1\n  mul = (mul * 10) % 2019\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s241060689", "group_id": "codeNet:p02703", "input_text": "local mmi, mma = math.min, math.max\nlocal n, m, s = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n  edge[i] = {}\nend\nlocal line = {}\nfor i = 1, m do\n  local u, v, a, b = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n  edge[u][v] = {a, b}\n  edge[v][u] = {a, b}\n  line[i] = {u, v, a, b}\nend\nlocal coin = {}\nlocal changetime = {}\nfor i = 1, n do\n  coin[i], changetime[i] = io.read(\"*n\", \"*n\")\nend\nlocal dp = {}\nfor i = 1, n do\n  dp[i] = {}\n  for j = 1, 2501 do\n    dp[i][j] = -1\n  end\nend\ns = mmi(s, 2500)\ndp[1][s + 1] = 0\nlocal function updateCity()\n  for i = 1, n do\n    for j = 1, 2501 do\n      if 0 <= dp[i][j] then\n        local dst = mmi(2501, j + coin[i])\n        if dp[i][dst] < 0 then\n          dp[i][dst] = dp[i][j] + changetime[i]\n        else\n          dp[i][dst] = mmi(dp[i][dst], dp[i][j] + changetime[i])\n        end\n      end\n    end\n  end\nend\nlocal function moveOn()\n  for il = 1, m do\n    local u, v, a, b = unpack(line[il])\n    for i = 1 + a, 2501 do\n      if 0 <= dp[u][i] then\n        if dp[v][i - a] < 0 then\n          dp[v][i - a] = dp[u][i] + b\n        else\n          dp[v][i - a] = mmi(dp[v][i - a], dp[u][i] + b)\n        end\n      end\n      if 0 <= dp[v][i] then\n        if dp[u][i - a] < 0 then\n          dp[u][i - a] = dp[v][i] + b\n        else\n          dp[u][i - a] = mmi(dp[u][i - a], dp[v][i] + b)\n        end\n      end\n    end\n  end\nend\nfor i = 1, 111 do\n  updateCity()\n  moveOn()\nend\nfor i = 2, n do\n  local ret = -1\n  for j = 1, 2501 do\n    if 0 <= dp[i][j] then\n      if ret < 0 then\n        ret = dp[i][j]\n      else\n        ret = mmi(ret, dp[i][j])\n      end\n    end\n  end\n  print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1587950719, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02703.html", "problem_id": "p02703", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02703/input.txt", "sample_output_relpath": "derived/input_output/data/p02703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02703/Lua/s241060689.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s241060689", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n14\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n, m, s = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, n do\n  edge[i] = {}\nend\nlocal line = {}\nfor i = 1, m do\n  local u, v, a, b = io.read(\"*n\", \"*n\", \"*n\", \"*n\")\n  edge[u][v] = {a, b}\n  edge[v][u] = {a, b}\n  line[i] = {u, v, a, b}\nend\nlocal coin = {}\nlocal changetime = {}\nfor i = 1, n do\n  coin[i], changetime[i] = io.read(\"*n\", \"*n\")\nend\nlocal dp = {}\nfor i = 1, n do\n  dp[i] = {}\n  for j = 1, 2501 do\n    dp[i][j] = -1\n  end\nend\ns = mmi(s, 2500)\ndp[1][s + 1] = 0\nlocal function updateCity()\n  for i = 1, n do\n    for j = 1, 2501 do\n      if 0 <= dp[i][j] then\n        local dst = mmi(2501, j + coin[i])\n        if dp[i][dst] < 0 then\n          dp[i][dst] = dp[i][j] + changetime[i]\n        else\n          dp[i][dst] = mmi(dp[i][dst], dp[i][j] + changetime[i])\n        end\n      end\n    end\n  end\nend\nlocal function moveOn()\n  for il = 1, m do\n    local u, v, a, b = unpack(line[il])\n    for i = 1 + a, 2501 do\n      if 0 <= dp[u][i] then\n        if dp[v][i - a] < 0 then\n          dp[v][i - a] = dp[u][i] + b\n        else\n          dp[v][i - a] = mmi(dp[v][i - a], dp[u][i] + b)\n        end\n      end\n      if 0 <= dp[v][i] then\n        if dp[u][i - a] < 0 then\n          dp[u][i - a] = dp[v][i] + b\n        else\n          dp[u][i - a] = mmi(dp[u][i - a], dp[v][i] + b)\n        end\n      end\n    end\n  end\nend\nfor i = 1, 111 do\n  updateCity()\n  moveOn()\nend\nfor i = 2, n do\n  local ret = -1\n  for j = 1, 2501 do\n    if 0 <= dp[i][j] then\n      if ret < 0 then\n        ret = dp[i][j]\n      else\n        ret = mmi(ret, dp[i][j])\n      end\n    end\n  end\n  print(ret)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "sample_input": "3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n"}, "reference_outputs": ["2\n14\n"], "source_document_id": "p02703", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1623, "cpu_time_ms": 1061, "memory_kb": 4572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s514560293", "group_id": "codeNet:p02705", "input_text": "r=io.read(\"*n\")\nprint(string.format(\"%.10f\",math.pi*r*2))", "language": "Lua", "metadata": {"date": 1588897677, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s514560293.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514560293", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "r=io.read(\"*n\")\nprint(string.format(\"%.10f\",math.pi*r*2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 5, "memory_kb": 2676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s765257627", "group_id": "codeNet:p02705", "input_text": "r=io.read(\"*n\")\nprint(string.format(\"%.10f\",math.pi*r*r))", "language": "Lua", "metadata": {"date": 1588897632, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s765257627.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s765257627", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "r=io.read(\"*n\")\nprint(string.format(\"%.10f\",math.pi*r*r))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s319949342", "group_id": "codeNet:p02705", "input_text": "a=io.read(\"*n\")\nprint(2*math.pi*a)", "language": "Lua", "metadata": {"date": 1587941917, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s319949342.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s319949342", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "a=io.read(\"*n\")\nprint(2*math.pi*a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 34, "cpu_time_ms": 2, "memory_kb": 2708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s652261805", "group_id": "codeNet:p02705", "input_text": "r = io.read(\"*n\")\nprint(2 * math.pi * r)", "language": "Lua", "metadata": {"date": 1587346220, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s652261805.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652261805", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "r = io.read(\"*n\")\nprint(2 * math.pi * r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s514811241", "group_id": "codeNet:p02705", "input_text": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)\n", "language": "Lua", "metadata": {"date": 1587345587, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s514811241.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514811241", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s541347856", "group_id": "codeNet:p02705", "input_text": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)", "language": "Lua", "metadata": {"date": 1587345084, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s541347856.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s541347856", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s572491468", "group_id": "codeNet:p02705", "input_text": "r = io.read(\"*n\")\nprint(3.1415926535 * r)", "language": "Lua", "metadata": {"date": 1587345064, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s572491468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s572491468", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "r = io.read(\"*n\")\nprint(3.1415926535 * r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s801173999", "group_id": "codeNet:p02705", "input_text": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)", "language": "Lua", "metadata": {"date": 1587345030, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s801173999.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s801173999", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local R = io.read(\"*n\")\n\nprint(2 * R * math.pi)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s628983062", "group_id": "codeNet:p02705", "input_text": "local r = io.read(\"*n\")\nprint(math.pi * r)", "language": "Lua", "metadata": {"date": 1587345024, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s628983062.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s628983062", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local r = io.read(\"*n\")\nprint(math.pi * r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s248846176", "group_id": "codeNet:p02705", "input_text": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "language": "Lua", "metadata": {"date": 1587344706, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s248846176.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s248846176", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 43, "cpu_time_ms": 3, "memory_kb": 2804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s162870387", "group_id": "codeNet:p02705", "input_text": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "language": "Lua", "metadata": {"date": 1587344664, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s162870387.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s162870387", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 43, "cpu_time_ms": 2, "memory_kb": 2736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s981495112", "group_id": "codeNet:p02705", "input_text": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "language": "Lua", "metadata": {"date": 1587344554, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s981495112.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s981495112", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "local r = io.read(\"*n\")\nprint(math.pi * r)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 43, "cpu_time_ms": 3, "memory_kb": 2708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s167531401", "group_id": "codeNet:p02705", "input_text": "print(io.read\"*n\"*math.pi*2)", "language": "Lua", "metadata": {"date": 1587344530, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lua/s167531401.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s167531401", "user_id": "u726173718"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "print(io.read\"*n\"*math.pi*2)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\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 circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 28, "cpu_time_ms": 3, "memory_kb": 2720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s840951291", "group_id": "codeNet:p02711", "input_text": "if io.read(1)==\"7\" or io.read(1)==\"7\" or io.read(1)==\"7\" then print(\"Yes\") else print(\"No\") end", "language": "Lua", "metadata": {"date": 1588358257, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lua/s840951291.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840951291", "user_id": "u000698877"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "if io.read(1)==\"7\" or io.read(1)==\"7\" or io.read(1)==\"7\" then print(\"Yes\") else print(\"No\") end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 9, "memory_kb": 2568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s223933426", "group_id": "codeNet:p02711", "input_text": "N=tostring(io.read())\nif N:sub(1,1) == \"7\" or N:sub(2,2) == \"7\" or N:sub(3,3) == \"7\" then print(\"Yes\") else print(\"No\") end", "language": "Lua", "metadata": {"date": 1587159417, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lua/s223933426.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223933426", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "N=tostring(io.read())\nif N:sub(1,1) == \"7\" or N:sub(2,2) == \"7\" or N:sub(3,3) == \"7\" then print(\"Yes\") else print(\"No\") end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s857350570", "group_id": "codeNet:p02711", "input_text": "print((io.read(1)==\"7\" or io.read(1)==\"7\" or io.read(1)==\"7\")and\"Yes\"or\"No\")", "language": "Lua", "metadata": {"date": 1586748988, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lua/s857350570.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s857350570", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print((io.read(1)==\"7\" or io.read(1)==\"7\" or io.read(1)==\"7\")and\"Yes\"or\"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s919229842", "group_id": "codeNet:p02711", "input_text": "local N = io.read(\"*l\")\n\nlocal isYes = false\nfor i = 1, 3 do\n    if N:sub(i, i) == \"7\" then\n        isYes = true\n    end\nend\n\nprint(isYes and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1586739930, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lua/s919229842.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919229842", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local N = io.read(\"*l\")\n\nlocal isYes = false\nfor i = 1, 3 do\n    if N:sub(i, i) == \"7\" then\n        isYes = true\n    end\nend\n\nprint(isYes and \"Yes\" or \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710089428", "group_id": "codeNet:p02711", "input_text": "a = io.read()\nf = a:find(\"7\")\nprint(f and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1586739646, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lua/s710089428.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710089428", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = io.read()\nf = a:find(\"7\")\nprint(f and \"Yes\" or \"No\")\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 2, "memory_kb": 2620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s126560874", "group_id": "codeNet:p02713", "input_text": "local function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\nlocal r = 0\nlocal k = io.read(\"*n\")\nfor i = 1, k do\n  for j = 1, k do\n    local g = getgcd(i, j)\n    for q = 1, k do\n      r = r + getgcd(g, q)\n    end\n  end\nend\nprint(r)\n", "language": "Lua", "metadata": {"date": 1587344236, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lua/s126560874.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126560874", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\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\nlocal r = 0\nlocal k = io.read(\"*n\")\nfor i = 1, k do\n  for j = 1, k do\n    local g = getgcd(i, j)\n    for q = 1, k do\n      r = r + getgcd(g, q)\n    end\n  end\nend\nprint(r)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 631, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s160998246", "group_id": "codeNet:p02713", "input_text": "K=io.read()\n\nfunction gcd(a,b)\n    if b ~= 0 then\n        return gcd(b, a % b)\n    else\n        return a\n    end\nend\n\nX={}\nfor i=1,K do\n    X[i] = {}\nend\n\nfor i=1,K do\n    for j=1,K do\n        X[i][j] = gcd(i,j)\n    end\nend\n\nsum = 0\nfor i=1,K do\n    for j=1,K do\n        for k=1, K do\n            sum = sum + gcd(X[i][j],k)\n        end\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1587160298, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lua/s160998246.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s160998246", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "K=io.read()\n\nfunction gcd(a,b)\n    if b ~= 0 then\n        return gcd(b, a % b)\n    else\n        return a\n    end\nend\n\nX={}\nfor i=1,K do\n    X[i] = {}\nend\n\nfor i=1,K do\n    for j=1,K do\n        X[i][j] = gcd(i,j)\n    end\nend\n\nsum = 0\nfor i=1,K do\n    for j=1,K do\n        for k=1, K do\n            sum = sum + gcd(X[i][j],k)\n        end\n    end\nend\nprint(sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 1423, "memory_kb": 3508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s189088072", "group_id": "codeNet:p02713", "input_text": "K=io.read()\n\nfunction gcd(a,b)\n    if b ~= 0 then\n        return gcd(b, a % b)\n    else\n        return a\n    end\nend\n\nsum = 0\nfor i=1,K do\n    for j=1,K do\n        for k=1,K do\n            sum = sum + gcd(gcd(i,j),k)\n        end\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1587159988, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lua/s189088072.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s189088072", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "K=io.read()\n\nfunction gcd(a,b)\n    if b ~= 0 then\n        return gcd(b, a % b)\n    else\n        return a\n    end\nend\n\nsum = 0\nfor i=1,K do\n    for j=1,K do\n        for k=1,K do\n            sum = sum + gcd(gcd(i,j),k)\n        end\n    end\nend\nprint(sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s631648281", "group_id": "codeNet:p02713", "input_text": "local K = io.read(\"*n\")\n\nlocal function euc(arg1, arg2)\n    --print(arg1, arg2)\n    if arg1 == arg2 or arg2 == 0 then\n        return arg1\n    elseif arg1 == 0 then\n        return arg2\n    elseif arg1 > arg2 then\n        return euc(arg2, arg1 % arg2)\n    else\n        return euc(arg1, arg2 % arg1)\n    end\nend\n\nlocal function gcd(i, j, k)\n    return euc(euc(i, j), euc(j, k))\nend\n\nlocal total = 0\nfor i = 1, K do\n    for j = 1, K do\n        for k = 1, K do\n            total = total + gcd(i, j, k)\n        end\n    end\nend\n\nprint(total)", "language": "Lua", "metadata": {"date": 1586742702, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lua/s631648281.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631648281", "user_id": "u793881115"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local K = io.read(\"*n\")\n\nlocal function euc(arg1, arg2)\n    --print(arg1, arg2)\n    if arg1 == arg2 or arg2 == 0 then\n        return arg1\n    elseif arg1 == 0 then\n        return arg2\n    elseif arg1 > arg2 then\n        return euc(arg2, arg1 % arg2)\n    else\n        return euc(arg1, arg2 % arg1)\n    end\nend\n\nlocal function gcd(i, j, k)\n    return euc(euc(i, j), euc(j, k))\nend\n\nlocal total = 0\nfor i = 1, K do\n    for j = 1, K do\n        for k = 1, K do\n            total = total + gcd(i, j, k)\n        end\n    end\nend\n\nprint(total)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 534, "cpu_time_ms": 1607, "memory_kb": 2744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s755211882", "group_id": "codeNet:p02713", "input_text": "\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\n\n\nlocal k = io.read(\"*n\")\nlocal ret = 0\nfor a = 1, k do for b = 1, k do for c = 1, k do\n  ret = ret + getgcd(a, getgcd(b, c))\nend end end\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1586739786, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lua/s755211882.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755211882", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\n\n\nlocal k = io.read(\"*n\")\nlocal ret = 0\nfor a = 1, k do for b = 1, k do for c = 1, k do\n  ret = ret + getgcd(a, getgcd(b, c))\nend end end\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\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\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 412, "memory_kb": 2732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s619633769", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nT[\"R\"]=0\nT[\"G\"]=0\nT[\"B\"]=0\nfor i=1,N do\n    T[S:sub(i,i)] = T[S:sub(i,i)] + 1\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)//2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "language": "Lua", "metadata": {"date": 1587166019, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s619633769.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619633769", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nT[\"R\"]=0\nT[\"G\"]=0\nT[\"B\"]=0\nfor i=1,N do\n    T[S:sub(i,i)] = T[S:sub(i,i)] + 1\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)//2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 964, "memory_kb": 2728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s518992354", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)//2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "language": "Lua", "metadata": {"date": 1587165837, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s518992354.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s518992354", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)//2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 998, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s886218056", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)/2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "language": "Lua", "metadata": {"date": 1587165465, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s886218056.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s886218056", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,(N-i)/2 do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 399, "cpu_time_ms": 1007, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s966729819", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,N do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "language": "Lua", "metadata": {"date": 1587165381, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s966729819.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s966729819", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\nT={}\nfor i=1,N do\n    if T[S:sub(i,i)] == nil then\n        T[S:sub(i,i)] = 1\n    else\n        T[S:sub(i,i)] = T[S:sub(i,i)] + 1\n    end\nend\n\nM=T[\"R\"]*T[\"G\"]*T[\"B\"]\n\nfor i=1,N do\n    x=S:sub(i,i)\n    for j=1,N do\n        y=S:sub(i+j,i+j)\n        z=S:sub(i+2*j,i+2*j)\n        if x~=y and y~=z and z~=x then\n            M = M-1\n        end\n    end\nend\n\nprint(M)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 393, "cpu_time_ms": 2205, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s904054865", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=1,N do\n        if S:sub(i,i)~=S:sub(j,j) then\n            for k=1,N do\n                if j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "language": "Lua", "metadata": {"date": 1587163428, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s904054865.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s904054865", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=1,N do\n        if S:sub(i,i)~=S:sub(j,j) then\n            for k=1,N do\n                if j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 2205, "memory_kb": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s024581057", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=i+1,N do\n        if S:sub(i,i)~=S:sub(j,j) then\n            for k=j+2,N do\n                if j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "language": "Lua", "metadata": {"date": 1587163358, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s024581057.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s024581057", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=i+1,N do\n        if S:sub(i,i)~=S:sub(j,j) then\n            for k=j+2,N do\n                if j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 2205, "memory_kb": 2784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s591281491", "group_id": "codeNet:p02714", "input_text": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=1,N do\n        if i<j then\n            for k=1,N do\n                if j<k and j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(j,j) and S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "language": "Lua", "metadata": {"date": 1587162888, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s591281491.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s591281491", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read(\"*n\", \"*l\")\nS=io.read()\n\ncounter = 0\n\nfor i=1,N do\n    for j=1,N do\n        if i<j then\n            for k=1,N do\n                if j<k and j-i~=k-j then\n                    if S:sub(i,i)~=S:sub(j,j) and S:sub(i,i)~=S:sub(k,k) and S:sub(j,j)~=S:sub(k,k) then\n                        counter = counter + 1\n                    end\n                end\n            end\n        end\n    end\nend\n\nprint(counter)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 414, "cpu_time_ms": 2205, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s317757472", "group_id": "codeNet:p02714", "input_text": "N=io.read\"*n\"\nio.read()\nS=io.read()\nlocal function count_char(s,c)\n\tlocal ret=0\n\tfor _ in s:gmatch(c)do ret=ret+1 end\n\treturn ret\nend\nc=count_char(S,\"R\")*count_char(S,\"G\")*count_char(S,\"B\")\nfor i=1,N do\n\tlocal I=S:sub(i,i)\n\tfor d=1,(N-i)/2 do\n\t\tlocal J=S:sub(i+d,i+d)\n\t\tlocal K=S:sub(i+d+d,i+d+d)\n\t\tif(I~=J and J~=K and K~=I)then c=c-1 end\n\tend\nend\nprint(c)", "language": "Lua", "metadata": {"date": 1586774428, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s317757472.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317757472", "user_id": "u726173718"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "N=io.read\"*n\"\nio.read()\nS=io.read()\nlocal function count_char(s,c)\n\tlocal ret=0\n\tfor _ in s:gmatch(c)do ret=ret+1 end\n\treturn ret\nend\nc=count_char(S,\"R\")*count_char(S,\"G\")*count_char(S,\"B\")\nfor i=1,N do\n\tlocal I=S:sub(i,i)\n\tfor d=1,(N-i)/2 do\n\t\tlocal J=S:sub(i+d,i+d)\n\t\tlocal K=S:sub(i+d+d,i+d+d)\n\t\tif(I~=J and J~=K and K~=I)then c=c-1 end\n\tend\nend\nprint(c)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 124, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462517641", "group_id": "codeNet:p02714", "input_text": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_bytes = {S:byte(1, N)}\nlocal R_count, G_count, B_count = 0LL, 0LL, 0LL\nlocal R, G, B = string.byte(\"RGB\", 1, 3)\n\nfor i = 1, N do\n    if S_bytes[i] == R then\n        R_count = R_count + 1\n    elseif S_bytes[i] == G then\n        G_count = G_count + 1\n    else\n        B_count = B_count + 1\n    end\nend\n\nlocal minus_count = 0LL\nfor i = 1, math.modf(N/2) do\n    for j = 1, N - i * 2 do\n        if S_bytes[j] ~= S_bytes[j + i]\n        and S_bytes[j + i] ~= S_bytes[j + 2 * i]\n        and S_bytes[j] ~= S_bytes[j + 2 * i] then\n            minus_count = minus_count + 1\n        end\n    end\nend\n\nprint(tostring(R_count * G_count * B_count - minus_count):sub(1, -3))", "language": "Lua", "metadata": {"date": 1586757109, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s462517641.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462517641", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_bytes = {S:byte(1, N)}\nlocal R_count, G_count, B_count = 0LL, 0LL, 0LL\nlocal R, G, B = string.byte(\"RGB\", 1, 3)\n\nfor i = 1, N do\n    if S_bytes[i] == R then\n        R_count = R_count + 1\n    elseif S_bytes[i] == G then\n        G_count = G_count + 1\n    else\n        B_count = B_count + 1\n    end\nend\n\nlocal minus_count = 0LL\nfor i = 1, math.modf(N/2) do\n    for j = 1, N - i * 2 do\n        if S_bytes[j] ~= S_bytes[j + i]\n        and S_bytes[j + i] ~= S_bytes[j + 2 * i]\n        and S_bytes[j] ~= S_bytes[j + 2 * i] then\n            minus_count = minus_count + 1\n        end\n    end\nend\n\nprint(tostring(R_count * G_count * B_count - minus_count):sub(1, -3))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 102, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s782685197", "group_id": "codeNet:p02714", "input_text": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_bytes = {S:byte(1, N)}\nlocal R_count, G_count, B_count = 0LL, 0LL, 0LL\nlocal R, G, B = string.byte(\"RGB\", 1, 3)\n\nfor i = 1, N do\n    if S_bytes[i] == R then\n        R_count = R_count + 1\n    elseif S_bytes[i] == G then\n        G_count = G_count + 1\n    else\n        B_count = B_count + 1\n    end\nend\n\nlocal minus_count = 0LL\nfor i = 1, math.modf(N/2) do\n    for j = 1, N - i * 2 do\n        print(i, j)\n        if S_bytes[j] ~= S_bytes[j + i]\n        and S_bytes[j + i] ~= S_bytes[j + 2 * i]\n        and S_bytes[j] ~= S_bytes[j + 2 * i] then\n            minus_count = minus_count + 1\n        end\n    end\nend\n\nprint(tostring(R_count * G_count * B_count - minus_count):sub(1, -3))", "language": "Lua", "metadata": {"date": 1586753598, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s782685197.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s782685197", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_bytes = {S:byte(1, N)}\nlocal R_count, G_count, B_count = 0LL, 0LL, 0LL\nlocal R, G, B = string.byte(\"RGB\", 1, 3)\n\nfor i = 1, N do\n    if S_bytes[i] == R then\n        R_count = R_count + 1\n    elseif S_bytes[i] == G then\n        G_count = G_count + 1\n    else\n        B_count = B_count + 1\n    end\nend\n\nlocal minus_count = 0LL\nfor i = 1, math.modf(N/2) do\n    for j = 1, N - i * 2 do\n        print(i, j)\n        if S_bytes[j] ~= S_bytes[j + i]\n        and S_bytes[j + i] ~= S_bytes[j + 2 * i]\n        and S_bytes[j] ~= S_bytes[j + 2 * i] then\n            minus_count = minus_count + 1\n        end\n    end\nend\n\nprint(tostring(R_count * G_count * B_count - minus_count):sub(1, -3))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 748, "cpu_time_ms": 614, "memory_kb": 34536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s753963783", "group_id": "codeNet:p02714", "input_text": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_byte = {S:byte(1, N)}\nlocal count = 0\nfor i = 1, N - 2 do\n    for j = i + 1, N - 1 do\n        for k = j + 1, N do\n            if j-i ~= k-j and S_byte[i] ~= S_byte[j] and S_byte[i] ~= S_byte[k] and S_byte[j] ~= S_byte[k] then\n                count = count + 1\n            end\n        end\n    end\nend\n\nprint(count)", "language": "Lua", "metadata": {"date": 1586743972, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s753963783.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s753963783", "user_id": "u793881115"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local N = io.read(\"*n\")\nio.read(\"*l\")\nlocal S = io.read(\"*l\")\n\nlocal S_byte = {S:byte(1, N)}\nlocal count = 0\nfor i = 1, N - 2 do\n    for j = i + 1, N - 1 do\n        for k = j + 1, N do\n            if j-i ~= k-j and S_byte[i] ~= S_byte[j] and S_byte[i] ~= S_byte[k] and S_byte[j] ~= S_byte[k] then\n                count = count + 1\n            end\n        end\n    end\nend\n\nprint(count)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 384, "cpu_time_ms": 2205, "memory_kb": 2744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s754947129", "group_id": "codeNet:p02714", "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)\nend\n\nlocal r = 0\nlocal g = 0\nlocal b = 0\nlocal rg, rb, gr, gb, br, bg = 0, 0, 0, 0, 0, 0\n\nlocal ret = 0\nfor i = 1, n do\n  if t[i] == \"R\" then\n    ret = ret + gb + bg\n    gr = gr + g\n    br = br + b\n    r = r + 1\n  elseif t[i] == \"G\" then\n    ret = ret + rb + br\n    rg = rg + r\n    bg = bg + b\n    g = g + 1\n  else\n    ret = ret + rg + gr\n    rb = rb + r\n    gb = gb + g\n    b = b + 1\n  end\nend\nfor mid = 1, n do\n  if n < 1 + mid + mid then break end\n  for left = 1, n do\n    local center, right = left + mid, left + mid + mid\n    if n < right then break end\n    if t[left] ~= t[center] and t[center] ~= t[right] and t[left] ~= t[right] then\n      ret = ret - 1\n    end\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1586740225, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lua/s754947129.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754947129", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\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)\nend\n\nlocal r = 0\nlocal g = 0\nlocal b = 0\nlocal rg, rb, gr, gb, br, bg = 0, 0, 0, 0, 0, 0\n\nlocal ret = 0\nfor i = 1, n do\n  if t[i] == \"R\" then\n    ret = ret + gb + bg\n    gr = gr + g\n    br = br + b\n    r = r + 1\n  elseif t[i] == \"G\" then\n    ret = ret + rb + br\n    rg = rg + r\n    bg = bg + b\n    g = g + 1\n  else\n    ret = ret + rg + gr\n    rb = rb + r\n    gb = gb + g\n    b = b + 1\n  end\nend\nfor mid = 1, n do\n  if n < 1 + mid + mid then break end\n  for left = 1, n do\n    local center, right = left + mid, left + mid + mid\n    if n < right then break end\n    if t[left] ~= t[center] and t[center] ~= t[right] and t[left] ~= t[right] then\n      ret = ret - 1\n    end\n  end\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 73, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s022658309", "group_id": "codeNet:p02717", "input_text": "local x,y,z=io.read(\"n\",\"n\",\"n\")\nx,y=y,x\nx,z=z,x\nprint(x,y,z)", "language": "Lua", "metadata": {"date": 1593052279, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s022658309.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s022658309", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "local x,y,z=io.read(\"n\",\"n\",\"n\")\nx,y=y,x\nx,z=z,x\nprint(x,y,z)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s289603895", "group_id": "codeNet:p02717", "input_text": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nprint(c .. \" \" .. a .. \" \" .. b)", "language": "Lua", "metadata": {"date": 1589908210, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s289603895.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289603895", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nprint(c .. \" \" .. a .. \" \" .. b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s198675388", "group_id": "codeNet:p02717", "input_text": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c ..a ..b)", "language": "Lua", "metadata": {"date": 1586050487, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s198675388.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198675388", "user_id": "u936678048"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c ..a ..b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s846672395", "group_id": "codeNet:p02717", "input_text": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c..a..b)", "language": "Lua", "metadata": {"date": 1586050448, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s846672395.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s846672395", "user_id": "u936678048"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c..a..b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s660575352", "group_id": "codeNet:p02717", "input_text": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(b..c..a)", "language": "Lua", "metadata": {"date": 1586050282, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s660575352.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s660575352", "user_id": "u936678048"}, "prompt_components": {"gold_output": "3 1 2\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 three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s602422735", "group_id": "codeNet:p02717", "input_text": "a, b, c = io.read(\"*a\", \"*b\", \"*c\")\nprint (c, b, a)", "language": "Lua", "metadata": {"date": 1586049087, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s602422735.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s602422735", "user_id": "u936678048"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "a, b, c = io.read(\"*a\", \"*b\", \"*c\")\nprint (c, b, a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s892536799", "group_id": "codeNet:p02717", "input_text": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c, b, a)", "language": "Lua", "metadata": {"date": 1586048950, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s892536799.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s892536799", "user_id": "u936678048"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "a, b, c =io.read(\"*n\", \"*n\", \"*n\")\nprint(c, b, a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s571398750", "group_id": "codeNet:p02717", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\na, b = b, a\na, c = c, a\nprint(tostring(a)..\" \"..tostring(b)..\" \"..tostring(c))", "language": "Lua", "metadata": {"date": 1586048850, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s571398750.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571398750", "user_id": "u793881115"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\na, b = b, a\na, c = c, a\nprint(tostring(a)..\" \"..tostring(b)..\" \"..tostring(c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s352323964", "group_id": "codeNet:p02717", "input_text": "local x,y,z=io.read(\"*n\",\"*n\",\"*n\")\nprint(z..\" \"..x..\" \"..y)", "language": "Lua", "metadata": {"date": 1586048695, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s352323964.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s352323964", "user_id": "u726173718"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "local x,y,z=io.read(\"*n\",\"*n\",\"*n\")\nprint(z..\" \"..x..\" \"..y)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 60, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s884626425", "group_id": "codeNet:p02717", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\na, b = b, a\na, c = c, a\nprint(a .. \" \" ..b .. \" \" .. c)\n", "language": "Lua", "metadata": {"date": 1586048453, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lua/s884626425.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s884626425", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\na, b = b, a\na, c = c, a\nprint(a .. \" \" ..b .. \" \" .. c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s787144018", "group_id": "codeNet:p02718", "input_text": "local n,m=io.read(\"n\",\"n\")\nlocal sum=0\nlocal a={}\nfor i=1,n do\n    input=io.read(\"n\")\n    a[i]=input\n    sum=sum+input\nend\ntable.sort(a)\n\nlocal counter=m\nfor i=n,1,-1 do\n    if a[i]>=sum/(4*m) then\n        counter=counter-1\n    end\nend\nprint(counter<=0 and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1593052565, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s787144018.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s787144018", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n,m=io.read(\"n\",\"n\")\nlocal sum=0\nlocal a={}\nfor i=1,n do\n    input=io.read(\"n\")\n    a[i]=input\n    sum=sum+input\nend\ntable.sort(a)\n\nlocal counter=m\nfor i=n,1,-1 do\n    if a[i]>=sum/(4*m) then\n        counter=counter-1\n    end\nend\nprint(counter<=0 and \"Yes\" or \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s780832046", "group_id": "codeNet:p02718", "input_text": "n, m = io.read(\"*n\", \"*n\")\na = {}\nasum = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  asum = asum + a[i]\nend\nc = 0\nfor i = 1, n do\n  if asum <= a[i] * 4 * m then\n    c = c + 1\n  end\nend\nprint(m <= c and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1589908302, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s780832046.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780832046", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n, m = io.read(\"*n\", \"*n\")\na = {}\nasum = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  asum = asum + a[i]\nend\nc = 0\nfor i = 1, n do\n  if asum <= a[i] * 4 * m then\n    c = c + 1\n  end\nend\nprint(m <= c and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s897250564", "group_id": "codeNet:p02718", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] >= all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1586050079, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s897250564.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s897250564", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] >= all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s293289364", "group_id": "codeNet:p02718", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0LL\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] > all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1586050005, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s293289364.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s293289364", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0LL\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] > all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s245476092", "group_id": "codeNet:p02718", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] > all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1586049698, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s245476092.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245476092", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal points = {}\nlocal all_point = 0\nfor i = 1, n do\n    points[i] = io.read(\"*n\")\n    all_point = all_point + points[i]\nend\n\ntable.sort(points, function(x, y) return x > y end)\n\nif points[m] > all_point / (4 * m) then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s061088110", "group_id": "codeNet:p02718", "input_text": "local N,M=io.read(\"*n\",\"*n\")\nlocal A={}\nlocal sum=0\nfor i=1,N do\n\tA[i]=io.read\"*n\"\n\tsum=sum+A[i]\nend\ntable.sort(A)\nif(A[N-M+1]*4*M<sum)then\n\tprint(\"No\")\nelse\n\tprint(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1586048928, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s061088110.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061088110", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local N,M=io.read(\"*n\",\"*n\")\nlocal A={}\nlocal sum=0\nfor i=1,N do\n\tA[i]=io.read\"*n\"\n\tsum=sum+A[i]\nend\ntable.sort(A)\nif(A[N-M+1]*4*M<sum)then\n\tprint(\"No\")\nelse\n\tprint(\"Yes\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s011480419", "group_id": "codeNet:p02718", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nlocal sum = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  sum = sum + a[i]\nend\ntable.sort(a, function(x, y) return x > y end)\nprint(a[m] * 4 * m < sum and \"No\" or \"Yes\")\n", "language": "Lua", "metadata": {"date": 1586048563, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lua/s011480419.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011480419", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal a = {}\nlocal sum = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  sum = sum + a[i]\nend\ntable.sort(a, function(x, y) return x > y end)\nprint(a[m] * 4 * m < sum and \"No\" or \"Yes\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_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 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s043447488", "group_id": "codeNet:p02727", "input_text": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal p = {}\nlocal s = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\ns = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\ns = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\nlocal t = {}\nfor i = 1, a + b + c do\n  t[i] = i\nend\ntable.sort(t, function(f, g) return p[f] > p[g] end)\nlocal ret = 0\nlocal use_x = 0\nlocal use_y = 0\nlocal total = 0\nfor i = 1, a + b + c do\n  local z = t[i]\n  if z <= a then\n    if use_x < x then\n      use_x = use_x + 1\n      total = total + 1\n      ret = ret + p[z]\n    end\n  elseif z <= a + b then\n    if use_y < y then\n      use_y = use_y + 1\n      total = total + 1\n      ret = ret + p[z]\n    end\n  else\n    total = total + 1\n    ret = ret + p[z]\n  end\n  if total == x + y then break end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1594601866, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s043447488.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043447488", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\", \"*l\")\nlocal p = {}\nlocal s = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\ns = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\ns = io.read()\nfor w in s:gmatch(\"%d+\") do\n  table.insert(p, tonumber(w))\nend\nlocal t = {}\nfor i = 1, a + b + c do\n  t[i] = i\nend\ntable.sort(t, function(f, g) return p[f] > p[g] end)\nlocal ret = 0\nlocal use_x = 0\nlocal use_y = 0\nlocal total = 0\nfor i = 1, a + b + c do\n  local z = t[i]\n  if z <= a then\n    if use_x < x then\n      use_x = use_x + 1\n      total = total + 1\n      ret = ret + p[z]\n    end\n  elseif z <= a + b then\n    if use_y < y then\n      use_y = use_y + 1\n      total = total + 1\n      ret = ret + p[z]\n    end\n  else\n    total = total + 1\n    ret = ret + p[z]\n  end\n  if total == x + y then break end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 889, "cpu_time_ms": 670, "memory_kb": 32520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s106865899", "group_id": "codeNet:p02727", "input_text": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal t={}\nfor i=1,a do\n    table.insert(t,{io.read(\"n\"),\"a\"})\nend\nfor i=1,b do\n    table.insert(t,{io.read(\"n\"),\"b\"})\nend\nfor i=1,c do\n    table.insert(t,{io.read(\"n\"),\"c\"})\nend\ntable.sort(t,function(a,b)\n    return a[1]<b[1]\nend)\n\nlocal max=0\nlocal aounter=0\nlocal bounter=0\nlocal counter=0\nfor i=a+b+c,1,-1 do\n    if aounter<x and t[i][2]==\"a\" then\n        aounter=aounter+1\n        max=max+t[i][1]\n    end\n    if bounter<y and t[i][2]==\"b\" then\n        bounter=bounter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter<x+y and t[i][2]==\"c\" then\n        counter=counter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter==x+y or aounter+bounter==x+y then\n        break\n    end\nend\nprint(string.format(\"%d\",max))", "language": "Lua", "metadata": {"date": 1593574514, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s106865899.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106865899", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal t={}\nfor i=1,a do\n    table.insert(t,{io.read(\"n\"),\"a\"})\nend\nfor i=1,b do\n    table.insert(t,{io.read(\"n\"),\"b\"})\nend\nfor i=1,c do\n    table.insert(t,{io.read(\"n\"),\"c\"})\nend\ntable.sort(t,function(a,b)\n    return a[1]<b[1]\nend)\n\nlocal max=0\nlocal aounter=0\nlocal bounter=0\nlocal counter=0\nfor i=a+b+c,1,-1 do\n    if aounter<x and t[i][2]==\"a\" then\n        aounter=aounter+1\n        max=max+t[i][1]\n    end\n    if bounter<y and t[i][2]==\"b\" then\n        bounter=bounter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter<x+y and t[i][2]==\"c\" then\n        counter=counter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter==x+y or aounter+bounter==x+y then\n        break\n    end\nend\nprint(string.format(\"%d\",max))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 455, "memory_kb": 25352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s962849841", "group_id": "codeNet:p02727", "input_text": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(string.format(\"%d\",max))", "language": "Lua", "metadata": {"date": 1593574441, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s962849841.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962849841", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(string.format(\"%d\",max))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 491, "memory_kb": 8716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s729014830", "group_id": "codeNet:p02727", "input_text": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1593574408, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s729014830.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s729014830", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 473, "memory_kb": 8652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848000525", "group_id": "codeNet:p02727", "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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(string.format(\"%d\",max))", "language": "Lua", "metadata": {"date": 1593574371, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s848000525.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848000525", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(string.format(\"%d\",max))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3811, "cpu_time_ms": 481, "memory_kb": 16752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s854164879", "group_id": "codeNet:p02727", "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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1593574251, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s854164879.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s854164879", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3791, "cpu_time_ms": 483, "memory_kb": 16636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s189587030", "group_id": "codeNet:p02727", "input_text": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1593574147, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s189587030.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189587030", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal A,B={},{}\nlocal t={}\n\nfor i=1,a do\n    A[i]=io.read(\"n\")\nend\ntable.sort(A,function(a,b)\n    return a>b\nend)\nfor i=1,x do\n    table.insert(t,A[i])\nend\n\nfor i=1,b do\n    B[i]=io.read(\"n\")\nend\ntable.sort(B,function(a,b)\n    return a>b\nend)\nfor i=1,y do\n    table.insert(t,B[i])\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 725, "memory_kb": 14576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s527746009", "group_id": "codeNet:p02727", "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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1593573689, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s527746009.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527746009", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\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 <lucas.morais.siqueira@gmail.com>\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 x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal q=PriorityQueue()\nlocal t={}\n\nfor i=1,a do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,x do\n    table.insert(t,q:pop())\nend\n\nq:initialize()\n\nfor i=1,b do\n    local input=io.read(\"n\")\n    q:put(input,-input)\nend\nfor i=1,y do\n    table.insert(t,q:pop())\nend\n\nfor i=1,c do\n    table.insert(t,io.read(\"n\"))\nend\n\ntable.sort(t,function(a,b)\n    return a>b\nend)\n\nlocal max=0\nfor i=1,x+y do\n    max=max+t[i]\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3791, "cpu_time_ms": 1635, "memory_kb": 36404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s244365918", "group_id": "codeNet:p02727", "input_text": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal t={}\nfor i=1,a do\n    table.insert(t,{io.read(\"n\"),\"a\"})\nend\nfor i=1,b do\n    table.insert(t,{io.read(\"n\"),\"b\"})\nend\nfor i=1,c do\n    table.insert(t,{io.read(\"n\"),\"c\"})\nend\ntable.sort(t,function(a,b)\n    return a[1]<b[1]\nend)\n\nlocal max=0\nlocal aounter=0\nlocal bounter=0\nlocal counter=0\nfor i=a+b+c,1,-1 do\n    if aounter<x and t[i][2]==\"a\" then\n        aounter=aounter+1\n        max=max+t[i][1]\n    end\n    if bounter<y and t[i][2]==\"b\" then\n        bounter=bounter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter<x+y and t[i][2]==\"c\" then\n        counter=counter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter==x+y or aounter+bounter==x+y then\n        break\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1593572204, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s244365918.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s244365918", "user_id": "u045238009"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x,y,a,b,c=io.read(\"n\",\"n\",\"n\",\"n\",\"n\")\nlocal t={}\nfor i=1,a do\n    table.insert(t,{io.read(\"n\"),\"a\"})\nend\nfor i=1,b do\n    table.insert(t,{io.read(\"n\"),\"b\"})\nend\nfor i=1,c do\n    table.insert(t,{io.read(\"n\"),\"c\"})\nend\ntable.sort(t,function(a,b)\n    return a[1]<b[1]\nend)\n\nlocal max=0\nlocal aounter=0\nlocal bounter=0\nlocal counter=0\nfor i=a+b+c,1,-1 do\n    if aounter<x and t[i][2]==\"a\" then\n        aounter=aounter+1\n        max=max+t[i][1]\n    end\n    if bounter<y and t[i][2]==\"b\" then\n        bounter=bounter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter<x+y and t[i][2]==\"c\" then\n        counter=counter+1\n        max=max+t[i][1]\n    end\n    if aounter+bounter+counter==x+y or aounter+bounter==x+y then\n        break\n    end\nend\nprint(max)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 884, "memory_kb": 43372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s129628681", "group_id": "codeNet:p02727", "input_text": "X,Y,A,B,C=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\np,q,r={},{},{}\nfor i=1,A do p[i]=io.read\"*n\" end\nfor i=1,B do q[i]=io.read\"*n\" end\nfor i=1,C do r[i]=io.read\"*n\" end\ntable.sort(p)\ntable.sort(q)\ntable.sort(r)\ns={}\nfor i=1,X do table.insert(s,p[A-i+1]) end\nfor i=1,Y do table.insert(s,q[B-i+1]) end\nfor i=1,C do table.insert(s,r[i]) end\ntable.sort(s)\nsum=0\nfor i=#s,#s-(X+Y)+1,-1 do\n\tsum=sum+s[i]\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1586157683, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s129628681.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s129628681", "user_id": "u726173718"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "X,Y,A,B,C=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\np,q,r={},{},{}\nfor i=1,A do p[i]=io.read\"*n\" end\nfor i=1,B do q[i]=io.read\"*n\" end\nfor i=1,C do r[i]=io.read\"*n\" end\ntable.sort(p)\ntable.sort(q)\ntable.sort(r)\ns={}\nfor i=1,X do table.insert(s,p[A-i+1]) end\nfor i=1,Y do table.insert(s,q[B-i+1]) end\nfor i=1,C do table.insert(s,r[i]) end\ntable.sort(s)\nsum=0\nfor i=#s,#s-(X+Y)+1,-1 do\n\tsum=sum+s[i]\nend\nprint(sum)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 404, "cpu_time_ms": 460, "memory_kb": 9088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s564999376", "group_id": "codeNet:p02727", "input_text": "X,Y,A,B,C=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\np,q,r={},{},{}\nfor i=1,A do p[i]=io.read\"*n\" end\nfor i=1,B do q[i]=io.read\"*n\" end\nfor i=1,C do r[i]=io.read\"*n\" end\ntable.sort(p)\ntable.sort(q)\ntable.sort(r)\nsum=0\nlocal function mymax(x,y,z,A,B)\n\tif(x>y)then\n\t\tif(x>=z)then\n\t\t\treturn 1,x\n\t\telse\n\t\t\treturn 3,z\n\t\tend\n\telse\n\t\tif(y>=z)then\n\t\t\treturn 2,y\n\t\telse\n\t\t\treturn 3,z\n\t\tend\n\tend\nend\nwhile(true)do\n\tif(X==0)then\n\t\tfor i=1,Y do\n\t\t\tif(q[B]<(r[C] or 0))then\n\t\t\t\tsum=sum+r[C]\n\t\t\t\tC=C-1\n\t\t\telse\n\t\t\t\tsum=sum+q[B]\n\t\t\t\tB=B-1\n\t\t\tend\n\t\tend\n\t\tprint(sum)break\n\telseif(Y==0)then\n\t\tfor i=1,X do\n\t\t\tif(p[A]<(r[C] or 0))then\n\t\t\t\tsum=sum+r[C]\n\t\t\t\tC=C-1\n\t\t\telse\n\t\t\t\tsum=sum+p[A]\n\t\t\t\tA=A-1\n\t\t\tend\n\t\tend\n\t\tprint(sum)break\n\tend\n\tlocal n,v=mymax(p[A],q[B],r[C])\n\tsum=sum+v\n\tif(n==1)then\n\t\tA=A-1\n\t\tX=X-1\n\telseif(n==2)then\n\t\tB=B-1\n\t\tY=Y-1\n\telse\n\t\tif(p[A]<q[B])then\n\t\t\tX=X-1\n\t\telse\n\t\t\tY=Y-1\n\t\tend\n\t\tC=C-1\n\tend\nend", "language": "Lua", "metadata": {"date": 1586156766, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s564999376.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s564999376", "user_id": "u726173718"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "X,Y,A,B,C=io.read(\"*n\",\"*n\",\"*n\",\"*n\",\"*n\")\np,q,r={},{},{}\nfor i=1,A do p[i]=io.read\"*n\" end\nfor i=1,B do q[i]=io.read\"*n\" end\nfor i=1,C do r[i]=io.read\"*n\" end\ntable.sort(p)\ntable.sort(q)\ntable.sort(r)\nsum=0\nlocal function mymax(x,y,z,A,B)\n\tif(x>y)then\n\t\tif(x>=z)then\n\t\t\treturn 1,x\n\t\telse\n\t\t\treturn 3,z\n\t\tend\n\telse\n\t\tif(y>=z)then\n\t\t\treturn 2,y\n\t\telse\n\t\t\treturn 3,z\n\t\tend\n\tend\nend\nwhile(true)do\n\tif(X==0)then\n\t\tfor i=1,Y do\n\t\t\tif(q[B]<(r[C] or 0))then\n\t\t\t\tsum=sum+r[C]\n\t\t\t\tC=C-1\n\t\t\telse\n\t\t\t\tsum=sum+q[B]\n\t\t\t\tB=B-1\n\t\t\tend\n\t\tend\n\t\tprint(sum)break\n\telseif(Y==0)then\n\t\tfor i=1,X do\n\t\t\tif(p[A]<(r[C] or 0))then\n\t\t\t\tsum=sum+r[C]\n\t\t\t\tC=C-1\n\t\t\telse\n\t\t\t\tsum=sum+p[A]\n\t\t\t\tA=A-1\n\t\t\tend\n\t\tend\n\t\tprint(sum)break\n\tend\n\tlocal n,v=mymax(p[A],q[B],r[C])\n\tsum=sum+v\n\tif(n==1)then\n\t\tA=A-1\n\t\tX=X-1\n\telseif(n==2)then\n\t\tB=B-1\n\t\tY=Y-1\n\telse\n\t\tif(p[A]<q[B])then\n\t\t\tX=X-1\n\t\telse\n\t\t\tY=Y-1\n\t\tend\n\t\tC=C-1\n\tend\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 885, "cpu_time_ms": 219, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s953368409", "group_id": "codeNet:p02727", "input_text": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    all_taste[#all_taste + 1] = r_taste[i]\nend\nfor i = 1, #g_taste do\n    all_taste[#all_taste + 1] = g_taste[i]\nend\ntable.sort(all_taste, function(x, y) return x > y end)\n\nlocal result = 0LL\nfor i = 1, r_eat + g_eat do\n    result = result + all_taste[i]\nend\nprint(tostring(result):sub(1, -3))", "language": "Lua", "metadata": {"date": 1586029609, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s953368409.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953368409", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    all_taste[#all_taste + 1] = r_taste[i]\nend\nfor i = 1, #g_taste do\n    all_taste[#all_taste + 1] = g_taste[i]\nend\ntable.sort(all_taste, function(x, y) return x > y end)\n\nlocal result = 0LL\nfor i = 1, r_eat + g_eat do\n    result = result + all_taste[i]\nend\nprint(tostring(result):sub(1, -3))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 878, "cpu_time_ms": 644, "memory_kb": 7424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s579914662", "group_id": "codeNet:p02727", "input_text": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal function writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\ntable.sort(a_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal function removeMin(list1, list2, list3)\n    if     list3 and (list1[#list1] <= list2[#list2]) then\n        table.remove((list1[#list1] <  list3[#list3]) and list1 or list3)\n    elseif list3 and (list2[#list2] <  list1[#list1]) then\n        table.remove((list2[#list2] <  list3[#list3]) and list2 or list3)\n    else\n        table.remove((list1[#list1] <  list2[#list2]) and list1 or list2)\n    end\nend\n\nfor i = 1, #a_taste do\n    if r_taste[#r_taste] and g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(r_taste, g_taste, a_taste)\n    elseif r_taste[#r_taste] and g_taste[#g_taste] then\n        removeMin(r_taste, g_taste)\n    elseif g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(g_taste, a_taste)\n    elseif a_taste[#a_taste] and r_taste[#r_taste] then\n        removeMin(a_taste, r_taste)\n    elseif r_taste[#r_taste] then\n        table.remove(r_taste)\n    elseif g_taste[#g_taste] then\n        table.remove(g_taste)\n    elseif a_taste[#a_taste] then\n        table.remove(a_taste)\n    end\nend\n\nlocal function samList(list)\n    local result_sam = 0LL\n    for i = 1, #list do\n        result_sam = result_sam + list[i]\n    end\n    return result_sam\nend\nlocal result = 0LL\nresult = samList(r_taste) + samList(g_taste) + samList(a_taste)\n\nprint(tostring(result):sub(1, -3))", "language": "Lua", "metadata": {"date": 1586029310, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s579914662.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579914662", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal function writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\ntable.sort(a_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal function removeMin(list1, list2, list3)\n    if     list3 and (list1[#list1] <= list2[#list2]) then\n        table.remove((list1[#list1] <  list3[#list3]) and list1 or list3)\n    elseif list3 and (list2[#list2] <  list1[#list1]) then\n        table.remove((list2[#list2] <  list3[#list3]) and list2 or list3)\n    else\n        table.remove((list1[#list1] <  list2[#list2]) and list1 or list2)\n    end\nend\n\nfor i = 1, #a_taste do\n    if r_taste[#r_taste] and g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(r_taste, g_taste, a_taste)\n    elseif r_taste[#r_taste] and g_taste[#g_taste] then\n        removeMin(r_taste, g_taste)\n    elseif g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(g_taste, a_taste)\n    elseif a_taste[#a_taste] and r_taste[#r_taste] then\n        removeMin(a_taste, r_taste)\n    elseif r_taste[#r_taste] then\n        table.remove(r_taste)\n    elseif g_taste[#g_taste] then\n        table.remove(g_taste)\n    elseif a_taste[#a_taste] then\n        table.remove(a_taste)\n    end\nend\n\nlocal function samList(list)\n    local result_sam = 0LL\n    for i = 1, #list do\n        result_sam = result_sam + list[i]\n    end\n    return result_sam\nend\nlocal result = 0LL\nresult = samList(r_taste) + samList(g_taste) + samList(a_taste)\n\nprint(tostring(result):sub(1, -3))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1900, "cpu_time_ms": 412, "memory_kb": 3456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s007466015", "group_id": "codeNet:p02727", "input_text": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal function writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\ntable.sort(a_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal function removeMin(list1, list2, list3)\n    if     list3 and (list1[#list1] <= list2[#list2]) then\n        table.remove((list1[#list1] <  list3[#list3]) and list1 or list3)\n    elseif list3 and (list2[#list2] <  list1[#list1]) then\n        table.remove((list2[#list2] <  list3[#list3]) and list2 or list3)\n    else\n        table.remove((list1[#list1] <  list2[#list2]) and list1 or list2)\n    end\nend\n\nfor i = 1, #a_taste do\n    if r_taste[#r_taste] and g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(r_taste, g_taste, a_taste)\n    elseif r_taste[#r_taste] and g_taste[#g_taste] then\n        removeMin(r_taste, g_taste)\n    elseif g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(g_taste, a_taste)\n    elseif a_taste[#a_taste] and r_taste[#r_taste] then\n        removeMin(a_taste, r_taste)\n    elseif r_taste[#r_taste] then\n        table.remove(r_taste)\n    elseif g_taste[#g_taste] then\n        table.remove(g_taste)\n    elseif a_taste[#a_taste] then\n        table.remove(a_taste)\n    end\nend\n\nlocal function samList(list)\n    local result_sam = 0\n    for i = 1, #list do\n        result_sam = result_sam + list[i]\n    end\n    return result_sam\nend\nlocal result = samList(r_taste) + samList(g_taste) + samList(a_taste)\n\nprint(result)", "language": "Lua", "metadata": {"date": 1586027675, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s007466015.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s007466015", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal function writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\ntable.sort(a_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal function removeMin(list1, list2, list3)\n    if     list3 and (list1[#list1] <= list2[#list2]) then\n        table.remove((list1[#list1] <  list3[#list3]) and list1 or list3)\n    elseif list3 and (list2[#list2] <  list1[#list1]) then\n        table.remove((list2[#list2] <  list3[#list3]) and list2 or list3)\n    else\n        table.remove((list1[#list1] <  list2[#list2]) and list1 or list2)\n    end\nend\n\nfor i = 1, #a_taste do\n    if r_taste[#r_taste] and g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(r_taste, g_taste, a_taste)\n    elseif r_taste[#r_taste] and g_taste[#g_taste] then\n        removeMin(r_taste, g_taste)\n    elseif g_taste[#g_taste] and a_taste[#a_taste] then\n        removeMin(g_taste, a_taste)\n    elseif a_taste[#a_taste] and r_taste[#r_taste] then\n        removeMin(a_taste, r_taste)\n    elseif r_taste[#r_taste] then\n        table.remove(r_taste)\n    elseif g_taste[#g_taste] then\n        table.remove(g_taste)\n    elseif a_taste[#a_taste] then\n        table.remove(a_taste)\n    end\nend\n\nlocal function samList(list)\n    local result_sam = 0\n    for i = 1, #list do\n        result_sam = result_sam + list[i]\n    end\n    return result_sam\nend\nlocal result = samList(r_taste) + samList(g_taste) + samList(a_taste)\n\nprint(result)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1864, "cpu_time_ms": 411, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s081156990", "group_id": "codeNet:p02727", "input_text": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    all_taste[#all_taste + 1] = r_taste[i]\nend\nfor i = 1, #g_taste do\n    all_taste[#all_taste + 1] = g_taste[i]\nend\ntable.sort(all_taste, function(x, y) return x > y end)\n\nlocal result = 0\nfor i = 1, r_eat + g_eat do\n    result = result + all_taste[i]\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1585970252, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s081156990.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s081156990", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste, function(x, y) return x > y end)\ntable.sort(g_taste, function(x, y) return x > y end)\nfor i = 1, r_num - r_eat do\n    r_taste[#r_taste] = nil\nend\nfor i = 1, g_num - g_eat do\n    g_taste[#g_taste] = nil\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    all_taste[#all_taste + 1] = r_taste[i]\nend\nfor i = 1, #g_taste do\n    all_taste[#all_taste + 1] = g_taste[i]\nend\ntable.sort(all_taste, function(x, y) return x > y end)\n\nlocal result = 0\nfor i = 1, r_eat + g_eat do\n    result = result + all_taste[i]\nend\nprint(result)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 855, "cpu_time_ms": 642, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s741333401", "group_id": "codeNet:p02727", "input_text": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    table.insert(all_taste, r_taste[i])\nend\nfor i = 1, #g_taste do\n    table.insert(all_taste, g_taste[i])\nend\ntable.sort(all_taste)\n\nlocal result = 0\nfor i = #all_taste, #all_taste - r_eat -g_eat + 1, -1 do\n    result = result + all_taste[i]\nend\nprint(result)", "language": "Lua", "metadata": {"date": 1585969066, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s741333401.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s741333401", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nlocal all_taste = a_taste\nfor i = 1, #r_taste do\n    table.insert(all_taste, r_taste[i])\nend\nfor i = 1, #g_taste do\n    table.insert(all_taste, g_taste[i])\nend\ntable.sort(all_taste)\n\nlocal result = 0\nfor i = #all_taste, #all_taste - r_eat -g_eat + 1, -1 do\n    result = result + all_taste[i]\nend\nprint(result)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 782, "cpu_time_ms": 2103, "memory_kb": 3580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s601183070", "group_id": "codeNet:p02727", "input_text": "--[[\n食べる数の領域確保\nrとgの最小の数を比較\n小さい方をaの最大と比較\n]]\nlocal r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste); table.sort(a_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nwhile true do\n    local a_taste_len = a_taste[#a_taste]\n    if a_taste_len and (r_taste[1] <= g_taste[1]) and (r_taste[1] < a_taste[a_taste_len]) then\n        table.remove(r_taste, 1)\n        table.insert(r_taste, table.remove(a_taste))\n    elseif a_taste_len and (g_taste[1] < r_taste[1]) and (g_taste[1] < a_taste[a_taste_len]) then\n        table.remove(g_taste, 1)\n        table.insert(g_taste, table.remove(a_taste))\n    else\n        break\n    end\nend\n\nlocal result = 0\nfor i = 1, r_eat do\n    result = result + r_taste[i]\nend\nfor i = 1, g_eat do\n    result = result + g_taste[i]\nend\n\nprint(result)", "language": "Lua", "metadata": {"date": 1585965227, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s601183070.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s601183070", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "--[[\n食べる数の領域確保\nrとgの最小の数を比較\n小さい方をaの最大と比較\n]]\nlocal r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste); table.sort(a_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nwhile true do\n    local a_taste_len = a_taste[#a_taste]\n    if a_taste_len and (r_taste[1] <= g_taste[1]) and (r_taste[1] < a_taste[a_taste_len]) then\n        table.remove(r_taste, 1)\n        table.insert(r_taste, table.remove(a_taste))\n    elseif a_taste_len and (g_taste[1] < r_taste[1]) and (g_taste[1] < a_taste[a_taste_len]) then\n        table.remove(g_taste, 1)\n        table.insert(g_taste, table.remove(a_taste))\n    else\n        break\n    end\nend\n\nlocal result = 0\nfor i = 1, r_eat do\n    result = result + r_taste[i]\nend\nfor i = 1, g_eat do\n    result = result + g_taste[i]\nend\n\nprint(result)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1197, "cpu_time_ms": 2107, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s119326419", "group_id": "codeNet:p02727", "input_text": "--[[\n食べる数の領域確保\nrとgの最小の数を比較\n小さい方をaの最大と比較\n]]\nlocal r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste); table.sort(a_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nwhile true do\n    local a_taste_len = a_taste[#a_taste]\n    if a_taste_len and (r_taste[1] <= g_taste[1]) and (r_taste[1] < a_taste_len) then\n        table.remove(r_taste, 1)\n        table.insert(r_taste, table.remove(a_taste))\n    elseif a_taste_len and (g_taste[1] < r_taste[1]) and (g_taste[1] < a_taste_len) then\n        table.remove(g_taste, 1)\n        table.insert(g_taste, table.remove(a_taste))\n    else\n        break\n    end\nend\n\nlocal result = 0\nfor i = 1, r_eat do\n    result = result + r_taste[i]\nend\nfor i = 1, g_eat do\n    result = result + g_taste[i]\nend\n\nprint(result)", "language": "Lua", "metadata": {"date": 1585964699, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s119326419.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s119326419", "user_id": "u793881115"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "--[[\n食べる数の領域確保\nrとgの最小の数を比較\n小さい方をaの最大と比較\n]]\nlocal r_eat, g_eat, r_num, g_num, a_num \n= io.read(\"*n\", \"*n\", \"*n\", \"*n\", \"*n\")\n\nfunction writeList(num)\n    local list = {}\n    for i = 1, num do\n        list[i] = io.read(\"*n\")\n    end\n    return list\nend\n\nlocal r_taste = writeList(r_num)\nlocal g_taste = writeList(g_num)\nlocal a_taste = writeList(a_num)\n\ntable.sort(r_taste); table.sort(g_taste); table.sort(a_taste)\nfor i = 1, r_num - r_eat do\n    table.remove(r_taste, 1)\nend\nfor i = 1, g_num - g_eat do\n    table.remove(g_taste, 1)\nend\n\nwhile true do\n    local a_taste_len = a_taste[#a_taste]\n    if a_taste_len and (r_taste[1] <= g_taste[1]) and (r_taste[1] < a_taste_len) then\n        table.remove(r_taste, 1)\n        table.insert(r_taste, table.remove(a_taste))\n    elseif a_taste_len and (g_taste[1] < r_taste[1]) and (g_taste[1] < a_taste_len) then\n        table.remove(g_taste, 1)\n        table.insert(g_taste, table.remove(a_taste))\n    else\n        break\n    end\nend\n\nlocal result = 0\nfor i = 1, r_eat do\n    result = result + r_taste[i]\nend\nfor i = 1, g_eat do\n    result = result + g_taste[i]\nend\n\nprint(result)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1179, "cpu_time_ms": 2103, "memory_kb": 3456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s878931056", "group_id": "codeNet:p02727", "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})\n--read.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 function readN(N)\n    local t={}\n    local s = read.l()\n    local ins = table.insert\n    for w in string.gmatch(s, \"[^%s]+\") do\n        ins(t, tonumber(w))\n    end\n    return t\nend\nlocal X,Y,A,B,C,_ = read.nnnnnl()\nlocal P = readN(A)\nlocal Q = readN(B)\nlocal R = readN(C)\ntable.sort(P, function(a,b) return a>b end)\ntable.sort(Q, function(a,b) return a>b end)\ntable.sort(R, function(a,b) return a>b end)\nlocal t = {}\nlocal sum = 0\nlocal froma = math.min(X, A)\nfor i=1,froma do\n    sum = sum + P[i]\n    table.insert(t, {P[i], 'R'})\nend\nlocal ptrr = froma\nlocal fromb = math.min(Y, B)\nfor i=1,fromb do\n    sum = sum + Q[i]\n    table.insert(t, {Q[i], 'G'})\nend\nlocal ptrg = fromb\nlocal lacka = math.max(X-A, 0)\nlocal lackb = math.max(Y-B, 0)\nfor i=1,lacka+lackb do\n    sum = sum + R[i]\n    table.insert(t, {R[i], 'W'})\nend\nassert(#t == X+Y)\nlocal ptrw = lacka + lackb + 1\nfor i=#t,1,-1 do\n    if ptrw > C then\n        break\n    end\n    local val, color = t[i][1], t[i][2]\n    --print(i, ptrw, R[ptrw], val, color)\n    if color == 'W' then\n        -- skip\n    elseif color == 'R' then\n        if val < R[ptrw] then\n            sum = sum - val\n            sum = sum + R[ptrw]\n            ptrw = ptrw + 1\n        end\n    elseif color == 'G' then\n        if val < R[ptrw] then\n            sum = sum - val\n            sum = sum + R[ptrw]\n            ptrw = ptrw + 1\n        end\n    end\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1585449357, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s878931056.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s878931056", "user_id": "u162773977"}, "prompt_components": {"gold_output": "12\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})\n--read.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 function readN(N)\n    local t={}\n    local s = read.l()\n    local ins = table.insert\n    for w in string.gmatch(s, \"[^%s]+\") do\n        ins(t, tonumber(w))\n    end\n    return t\nend\nlocal X,Y,A,B,C,_ = read.nnnnnl()\nlocal P = readN(A)\nlocal Q = readN(B)\nlocal R = readN(C)\ntable.sort(P, function(a,b) return a>b end)\ntable.sort(Q, function(a,b) return a>b end)\ntable.sort(R, function(a,b) return a>b end)\nlocal t = {}\nlocal sum = 0\nlocal froma = math.min(X, A)\nfor i=1,froma do\n    sum = sum + P[i]\n    table.insert(t, {P[i], 'R'})\nend\nlocal ptrr = froma\nlocal fromb = math.min(Y, B)\nfor i=1,fromb do\n    sum = sum + Q[i]\n    table.insert(t, {Q[i], 'G'})\nend\nlocal ptrg = fromb\nlocal lacka = math.max(X-A, 0)\nlocal lackb = math.max(Y-B, 0)\nfor i=1,lacka+lackb do\n    sum = sum + R[i]\n    table.insert(t, {R[i], 'W'})\nend\nassert(#t == X+Y)\nlocal ptrw = lacka + lackb + 1\nfor i=#t,1,-1 do\n    if ptrw > C then\n        break\n    end\n    local val, color = t[i][1], t[i][2]\n    --print(i, ptrw, R[ptrw], val, color)\n    if color == 'W' then\n        -- skip\n    elseif color == 'R' then\n        if val < R[ptrw] then\n            sum = sum - val\n            sum = sum + R[ptrw]\n            ptrw = ptrw + 1\n        end\n    elseif color == 'G' then\n        if val < R[ptrw] then\n            sum = sum - val\n            sum = sum + R[ptrw]\n            ptrw = ptrw + 1\n        end\n    end\nend\nprint(sum)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2272, "cpu_time_ms": 769, "memory_kb": 32516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s356239524", "group_id": "codeNet:p02727", "input_text": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal p, q, r = {}, {}, {}\nfor i = 1, a do\n  p[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n  q[i] = io.read(\"*n\")\nend\nfor i = 1, c do\n  r[i] = io.read(\"*n\")\nend\ntable.sort(p, function(x, y) return x > y end)\ntable.sort(q, function(x, y) return x > y end)\ntable.sort(r, function(x, y) return x > y end)\nlocal redsum = 0LL\nfor i = 1, x do\n  redsum = redsum + p[i]\nend\nlocal greensum = 0LL\nfor i = 1, y do\n  greensum = greensum + q[i]\nend\nlocal redpos, greenpos = x, y\nlocal totsum = redsum + greensum\nfor i = 1, c do\n  local changed = false\n  local cv = r[i]\n  if 0 < redpos and 0 < greenpos then\n    if p[redpos] < q[greenpos] then\n      if p[redpos] < cv then\n        totsum = totsum - p[redpos] + cv\n        redpos = redpos - 1\n        changed = true\n      end\n    else\n      if q[greenpos] < cv then\n        totsum = totsum - q[greenpos] + cv\n        greenpos = greenpos - 1\n        changed = true\n      end\n    end\n  elseif 0 < redpos then\n    if p[redpos] < cv then\n      totsum = totsum - p[redpos] + cv\n      redpos = redpos - 1\n      changed = true\n    end\n  elseif 0 < greenpos then\n    if q[greenpos] < cv then\n      totsum = totsum - q[greenpos] + cv\n      greenpos = greenpos - 1\n      changed = true\n    end\n  end\n  if not changed then break end\nend\nlocal str = tostring(totsum):gsub(\"LL\", \"\")\nprint(str)\n", "language": "Lua", "metadata": {"date": 1585445312, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s356239524.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s356239524", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal p, q, r = {}, {}, {}\nfor i = 1, a do\n  p[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n  q[i] = io.read(\"*n\")\nend\nfor i = 1, c do\n  r[i] = io.read(\"*n\")\nend\ntable.sort(p, function(x, y) return x > y end)\ntable.sort(q, function(x, y) return x > y end)\ntable.sort(r, function(x, y) return x > y end)\nlocal redsum = 0LL\nfor i = 1, x do\n  redsum = redsum + p[i]\nend\nlocal greensum = 0LL\nfor i = 1, y do\n  greensum = greensum + q[i]\nend\nlocal redpos, greenpos = x, y\nlocal totsum = redsum + greensum\nfor i = 1, c do\n  local changed = false\n  local cv = r[i]\n  if 0 < redpos and 0 < greenpos then\n    if p[redpos] < q[greenpos] then\n      if p[redpos] < cv then\n        totsum = totsum - p[redpos] + cv\n        redpos = redpos - 1\n        changed = true\n      end\n    else\n      if q[greenpos] < cv then\n        totsum = totsum - q[greenpos] + cv\n        greenpos = greenpos - 1\n        changed = true\n      end\n    end\n  elseif 0 < redpos then\n    if p[redpos] < cv then\n      totsum = totsum - p[redpos] + cv\n      redpos = redpos - 1\n      changed = true\n    end\n  elseif 0 < greenpos then\n    if q[greenpos] < cv then\n      totsum = totsum - q[greenpos] + cv\n      greenpos = greenpos - 1\n      changed = true\n    end\n  end\n  if not changed then break end\nend\nlocal str = tostring(totsum):gsub(\"LL\", \"\")\nprint(str)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1387, "cpu_time_ms": 375, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s702051873", "group_id": "codeNet:p02727", "input_text": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal p, q, r = {}, {}, {}\nfor i = 1, a do\n  p[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n  q[i] = io.read(\"*n\")\nend\nfor i = 1, c do\n  r[i] = io.read(\"*n\")\nend\ntable.sort(p, function(x, y) return x > y end)\ntable.sort(q, function(x, y) return x > y end)\ntable.sort(r, function(x, y) return x > y end)\nlocal redsum = 0LL\nfor i = 1, x do\n  redsum = redsum + p[i]\nend\nlocal greensum = 0LL\nfor i = 1, y do\n  greensum = greensum + q[i]\nend\nlocal redpos, greenpos = x, y\nlocal totsum = redsum + greensum\nfor i = 1, c do\n  local changed = false\n  local cv = r[i]\n  if 0 < redpos and 0 < greenpos then\n    if p[redpos] < q[greenpos] then\n      if p[redpos] < cv then\n        totsum = totsum - p[redpos] + cv\n        redpos = redpos - 1\n      end\n    else\n      if q[greenpos] < cv then\n        totsum = totsum - q[greenpos] + cv\n        greenpos = greenpos - 1\n      end\n    end\n  elseif 0 < redpos then\n    if p[redpos] < cv then\n      totsum = totsum - p[redpos] + cv\n      redpos = redpos - 1\n    end\n  elseif 0 < greenpos then\n    if q[greenpos] < cv then\n      totsum = totsum - q[greenpos] + cv\n      greenpos = greenpos - 1\n    end\n  end\n  if not changed then break end\nend\nlocal str = tostring(totsum):gsub(\"LL\", \"\")\nprint(str)\n", "language": "Lua", "metadata": {"date": 1585445166, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lua/s702051873.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702051873", "user_id": "u120582723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "local x, y = io.read(\"*n\", \"*n\")\nlocal a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal p, q, r = {}, {}, {}\nfor i = 1, a do\n  p[i] = io.read(\"*n\")\nend\nfor i = 1, b do\n  q[i] = io.read(\"*n\")\nend\nfor i = 1, c do\n  r[i] = io.read(\"*n\")\nend\ntable.sort(p, function(x, y) return x > y end)\ntable.sort(q, function(x, y) return x > y end)\ntable.sort(r, function(x, y) return x > y end)\nlocal redsum = 0LL\nfor i = 1, x do\n  redsum = redsum + p[i]\nend\nlocal greensum = 0LL\nfor i = 1, y do\n  greensum = greensum + q[i]\nend\nlocal redpos, greenpos = x, y\nlocal totsum = redsum + greensum\nfor i = 1, c do\n  local changed = false\n  local cv = r[i]\n  if 0 < redpos and 0 < greenpos then\n    if p[redpos] < q[greenpos] then\n      if p[redpos] < cv then\n        totsum = totsum - p[redpos] + cv\n        redpos = redpos - 1\n      end\n    else\n      if q[greenpos] < cv then\n        totsum = totsum - q[greenpos] + cv\n        greenpos = greenpos - 1\n      end\n    end\n  elseif 0 < redpos then\n    if p[redpos] < cv then\n      totsum = totsum - p[redpos] + cv\n      redpos = redpos - 1\n    end\n  elseif 0 < greenpos then\n    if q[greenpos] < cv then\n      totsum = totsum - q[greenpos] + cv\n      greenpos = greenpos - 1\n    end\n  end\n  if not changed then break end\nend\nlocal str = tostring(totsum):gsub(\"LL\", \"\")\nprint(str)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\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\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1299, "cpu_time_ms": 365, "memory_kb": 3456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s199263429", "group_id": "codeNet:p02743", "input_text": "a,b,c=io.read(\"n\",\"n\",\"n\") d=c-b-a print(d>0 and d*d>4*a*b and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1590375333, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s199263429.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199263429", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "a,b,c=io.read(\"n\",\"n\",\"n\") d=c-b-a print(d>0 and d*d>4*a*b and \"Yes\" or \"No\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s645096163", "group_id": "codeNet:p02743", "input_text": "a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nd=c-b-a\nprint(d>0 and d*d>4*a*b and \"Yes\" or \"No\") ", "language": "Lua", "metadata": {"date": 1590374939, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s645096163.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s645096163", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nd=c-b-a\nprint(d>0 and d*d>4*a*b and \"Yes\" or \"No\") ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s502945280", "group_id": "codeNet:p02743", "input_text": "m=math.sqrt\na,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(m(a)+m(b)<m(c) and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1590373866, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s502945280.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s502945280", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "m=math.sqrt\na,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(m(a)+m(b)<m(c) and \"Yes\" or \"No\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361586687", "group_id": "codeNet:p02743", "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,b,c = read.nnn()\n--if c - a - b <= 0 then\n--    print(\"No\")\n--else\n    local r = (c-a-b)*(c-a-b)\n    local l = 4 * a * b\n    if l < r then\n        print('Yes')\n    else\n        print('No')\n    end\n--end", "language": "Lua", "metadata": {"date": 1584240132, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s361586687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361586687", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No\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,b,c = read.nnn()\n--if c - a - b <= 0 then\n--    print(\"No\")\n--else\n    local r = (c-a-b)*(c-a-b)\n    local l = 4 * a * b\n    if l < r then\n        print('Yes')\n    else\n        print('No')\n    end\n--end", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1081, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s273250155", "group_id": "codeNet:p02743", "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,b,c = read.nnn()\nif c - a - b <= 0 then\n    print(\"No\")\nelse\n    local r = (c-a-b)*(c-a-b)\n    local l = 4 * a * b\n    if l < r then\n        print('Yes')\n    else\n        print('No')\n    end\nend", "language": "Lua", "metadata": {"date": 1584236441, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s273250155.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s273250155", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No\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,b,c = read.nnn()\nif c - a - b <= 0 then\n    print(\"No\")\nelse\n    local r = (c-a-b)*(c-a-b)\n    local l = 4 * a * b\n    if l < r then\n        print('Yes')\n    else\n        print('No')\n    end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1073, "cpu_time_ms": 144, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s999788088", "group_id": "codeNet:p02743", "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,b,c = read.nnn()\ns = math.sqrt\nif s(a)+s(b)<s(c) then print(\"Yes\")\nelse print(\"No\") end", "language": "Lua", "metadata": {"date": 1584234639, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s999788088.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s999788088", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No\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,b,c = read.nnn()\ns = math.sqrt\nif s(a)+s(b)<s(c) then print(\"Yes\")\nelse print(\"No\") end", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 966, "cpu_time_ms": 11, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s800144276", "group_id": "codeNet:p02743", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal d = c - a - b\nif d < 0 then\n  print(\"No\")\nelse\n  local f = d * d > 4 * a * b\n  print(f and \"Yes\" or \"No\")\nend\n", "language": "Lua", "metadata": {"date": 1584234528, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s800144276.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800144276", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal d = c - a - b\nif d < 0 then\n  print(\"No\")\nelse\n  local f = d * d > 4 * a * b\n  print(f and \"Yes\" or \"No\")\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 124, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s214954922", "group_id": "codeNet:p02743", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal d = c - a - b\nlocal f = d * d > 4 * a * b\nprint(f and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1584234442, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lua/s214954922.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s214954922", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nlocal d = c - a - b\nlocal f = d * d > 4 * a * b\nprint(f and \"Yes\" or \"No\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\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\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 117, "cpu_time_ms": 105, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s829735926", "group_id": "codeNet:p02761", "input_text": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nif n == 1 and m == 0 then\n\tprint(0)\n\tos.exit()\nend\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif n ~= 1 and s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "language": "Lua", "metadata": {"date": 1600141552, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s829735926.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s829735926", "user_id": "u793881115"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nif n == 1 and m == 0 then\n\tprint(0)\n\tos.exit()\nend\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif n ~= 1 and s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s971059751", "group_id": "codeNet:p02761", "input_text": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif n ~= 1 and s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "language": "Lua", "metadata": {"date": 1600140897, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s971059751.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971059751", "user_id": "u793881115"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif n ~= 1 and s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 468, "cpu_time_ms": 6, "memory_kb": 2708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s069046560", "group_id": "codeNet:p02761", "input_text": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "language": "Lua", "metadata": {"date": 1600140662, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s069046560.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s069046560", "user_id": "u793881115"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local read = io.read\n\nlocal n, m = read(\"n\", \"n\")\nlocal key_s_t = {}\nfor i = 1, m do\n\tlocal s_i, c_i = read(\"n\", \"n\")\n\tif s_i == 1 and c_i == 0 then\n\t\tprint(-1)\n\t\tos.exit()\n\tend\n\tif key_s_t[s_i] and key_s_t[s_i] ~= c_i then\n\t\tprint(-1)\n\t\tos.exit()\n\telseif not key_s_t[s_i] then\n\t\tkey_s_t[s_i] = c_i\n\tend\nend\nfor i = 1, n do\n\tif not key_s_t[i] then\n\t\tif i == 1 then\n\t\t\tkey_s_t[i] = 1\n\t\telse\n\t\t\tkey_s_t[i] = 0\n\t\tend\n\tend\nend\n\nprint(table.concat(key_s_t, \"\"))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s956243264", "group_id": "codeNet:p02761", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = -1\nend\nlocal valid = true\nfor i = 1, m do\n  local s, c = io.read(\"*n\", \"*n\")\n  if s == 1 and c == 0 and 1 < n then\n    valid = false\n  end\n  if 0 <= t[s] and t[s] ~= c then\n    valid = false\n  end\n  t[s] = c\nend\nif not valid then\n  print(-1)\nelse\n  for i = 1, n do\n    if t[i] == -1 then\n      if i == 1 and n ~= 1 then io.write(1)\n      else io.write(0)\n      end\n    else\n      io.write(t[i])\n    end\n  end\n  io.write(\"\\n\")\nend\n", "language": "Lua", "metadata": {"date": 1589909572, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s956243264.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s956243264", "user_id": "u120582723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = -1\nend\nlocal valid = true\nfor i = 1, m do\n  local s, c = io.read(\"*n\", \"*n\")\n  if s == 1 and c == 0 and 1 < n then\n    valid = false\n  end\n  if 0 <= t[s] and t[s] ~= c then\n    valid = false\n  end\n  t[s] = c\nend\nif not valid then\n  print(-1)\nelse\n  for i = 1, n do\n    if t[i] == -1 then\n      if i == 1 and n ~= 1 then io.write(1)\n      else io.write(0)\n      end\n    else\n      io.write(t[i])\n    end\n  end\n  io.write(\"\\n\")\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 501, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s386313566", "group_id": "codeNet:p02761", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = -1\nend\nlocal valid = true\nfor i = 1, m do\n  local s, c = io.read(\"*n\", \"*n\")\n  if s == 1 and c == 0 and 1 < n then\n    valid = false\n  end\n  if 0 <= t[s] and t[s] ~= c then\n    valid = false\n  end\n  t[s] = c\nend\nif not valid then\n  print(-1)\nelse\n  for i = 1, n do\n    if t[i] == -1 then\n      if i == 1 or n == 1 then io.write(1)\n      else io.write(0)\n      end\n    else\n      io.write(t[i])\n    end\n  end\n  io.write(\"\\n\")\nend\n", "language": "Lua", "metadata": {"date": 1589909486, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s386313566.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s386313566", "user_id": "u120582723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = -1\nend\nlocal valid = true\nfor i = 1, m do\n  local s, c = io.read(\"*n\", \"*n\")\n  if s == 1 and c == 0 and 1 < n then\n    valid = false\n  end\n  if 0 <= t[s] and t[s] ~= c then\n    valid = false\n  end\n  t[s] = c\nend\nif not valid then\n  print(-1)\nelse\n  for i = 1, n do\n    if t[i] == -1 then\n      if i == 1 or n == 1 then io.write(1)\n      else io.write(0)\n      end\n    else\n      io.write(t[i])\n    end\n  end\n  io.write(\"\\n\")\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 500, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s855686765", "group_id": "codeNet:p02761", "input_text": "n,m=io.read(\"*n\",\"*n\",\"*l\")\n\nt={}\nif m>=1 then\n    for i=1,m do\n        s,c=io.read(\"*n\",\"*n\",\"*l\")\n        c=tostring(c)\n        if not t[s] or t[s]==c then\n            t[s]=c\n        else\n            print(-1)\n            return\n        end\n    end\n    for i=1,n do\n        if not t[i] and i==1 then\n            t[i]=\"1\"\n        elseif not t[i] then\n            t[i]=\"0\"\n        end\n    end\n    x=\"0\"\n    for i=1,n do\n        x=x..t[i]\n    end\n    if #x:sub(2,n+1)~=#tostring(tonumber(x)) then\n        print(-1)\n        return\n    elseif #x:sub(2,n+1)==#tostring(tonumber(x)) then\n        print(tonumber(x))\n        return\n    end\nelse\n    if n==1 then\n        print(0)\n        return\n    else\n        x=\"100\"\n        print(x:sub(1,n))\n        return\n    end\nend", "language": "Lua", "metadata": {"date": 1587264789, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s855686765.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855686765", "user_id": "u045238009"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\",\"*l\")\n\nt={}\nif m>=1 then\n    for i=1,m do\n        s,c=io.read(\"*n\",\"*n\",\"*l\")\n        c=tostring(c)\n        if not t[s] or t[s]==c then\n            t[s]=c\n        else\n            print(-1)\n            return\n        end\n    end\n    for i=1,n do\n        if not t[i] and i==1 then\n            t[i]=\"1\"\n        elseif not t[i] then\n            t[i]=\"0\"\n        end\n    end\n    x=\"0\"\n    for i=1,n do\n        x=x..t[i]\n    end\n    if #x:sub(2,n+1)~=#tostring(tonumber(x)) then\n        print(-1)\n        return\n    elseif #x:sub(2,n+1)==#tostring(tonumber(x)) then\n        print(tonumber(x))\n        return\n    end\nelse\n    if n==1 then\n        print(0)\n        return\n    else\n        x=\"100\"\n        print(x:sub(1,n))\n        return\n    end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s637351911", "group_id": "codeNet:p02761", "input_text": "N=io.read\"*n\"\nM=io.read\"*n\"\nsc={}\nfor i=1,M do\n  sc[i]={io.read\"*n\",io.read\"*n\"}\nend\n\nfunction f(i,j,k)\n    for _,v in ipairs(sc)do\n        if(v[1]==1)then\n            if(v[2]~=i)then return false end\n        elseif(v[1]==2)then\n            if(v[2]~=j)then return false end\n        else\n            if(v[2]~=k)then return false end\n        end\n    end\n    return true\nend\nn=-1\nfunction g()\nfor i=0,9 do for j=0,9 do for k=0,9 do\n    if(f(i,j,k))then if(select(N,k,j,i)~=0)then n=i*100+j*10+k return end end\nend end end\nend\ng()\nprint(n)", "language": "Lua", "metadata": {"date": 1587245497, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s637351911.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s637351911", "user_id": "u726173718"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "N=io.read\"*n\"\nM=io.read\"*n\"\nsc={}\nfor i=1,M do\n  sc[i]={io.read\"*n\",io.read\"*n\"}\nend\n\nfunction f(i,j,k)\n    for _,v in ipairs(sc)do\n        if(v[1]==1)then\n            if(v[2]~=i)then return false end\n        elseif(v[1]==2)then\n            if(v[2]~=j)then return false end\n        else\n            if(v[2]~=k)then return false end\n        end\n    end\n    return true\nend\nn=-1\nfunction g()\nfor i=0,9 do for j=0,9 do for k=0,9 do\n    if(f(i,j,k))then if(select(N,k,j,i)~=0)then n=i*100+j*10+k return end end\nend end end\nend\ng()\nprint(n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 535, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s513943164", "group_id": "codeNet:p02761", "input_text": "N=io.read\"*n\"\nM=io.read\"*n\"\nsc={}\nfor i=1,M do\n  sc[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(sc,function(a,b)return a[1]<b[1]end)\nfunction f(sc)\n  r={}\n  for _,v in ipairs(sc) do\n    if(v[1]==1)then\n\t  if(v[2]==0)then return -1 end\n    end\n    if(r[v[1]] and r[v[1]]~=v[2])then return -1 end\n    r[v[1]]=v[2]\n  end\n  if(r[1]==nil)then r[1]=1 end\n  for i=2,N do\n    if(r[i]==nil)then r[i]=0 end\n  end\n  return table.concat(r)\nend\nprint(f(sc))", "language": "Lua", "metadata": {"date": 1587244462, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s513943164.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s513943164", "user_id": "u726173718"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "N=io.read\"*n\"\nM=io.read\"*n\"\nsc={}\nfor i=1,M do\n  sc[i]={io.read(\"*n\",\"*n\")}\nend\ntable.sort(sc,function(a,b)return a[1]<b[1]end)\nfunction f(sc)\n  r={}\n  for _,v in ipairs(sc) do\n    if(v[1]==1)then\n\t  if(v[2]==0)then return -1 end\n    end\n    if(r[v[1]] and r[v[1]]~=v[2])then return -1 end\n    r[v[1]]=v[2]\n  end\n  if(r[1]==nil)then r[1]=1 end\n  for i=2,N do\n    if(r[i]==nil)then r[i]=0 end\n  end\n  return table.concat(r)\nend\nprint(f(sc))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s140580895", "group_id": "codeNet:p02761", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal min, max = 0, 9\nif n == 2 then\n  min, max = 10, 99\nelseif n == 3 then\n  min, max = 100, 999\nend\nlocal s, c = {}, {}\nfor i = 1, m do\n  local x, y = io.read(\"*n\", \"*n\")\n  s[i], c[i] = x, tostring(y)\nend\nlocal f = false\nfor ic = min, max do\n  local str = tostring(ic)\n  f = true\n  for i = 1, m do\n    if n < s[i] or str:sub(s[i], s[i]) ~= c[i] then\n      f = false\n      break\n    end\n  end\n  if f then print(ic) break end\nend\nif not f then print(-1) end\n", "language": "Lua", "metadata": {"date": 1583114867, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s140580895.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s140580895", "user_id": "u120582723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal min, max = 0, 9\nif n == 2 then\n  min, max = 10, 99\nelseif n == 3 then\n  min, max = 100, 999\nend\nlocal s, c = {}, {}\nfor i = 1, m do\n  local x, y = io.read(\"*n\", \"*n\")\n  s[i], c[i] = x, tostring(y)\nend\nlocal f = false\nfor ic = min, max do\n  local str = tostring(ic)\n  f = true\n  for i = 1, m do\n    if n < s[i] or str:sub(s[i], s[i]) ~= c[i] then\n      f = false\n      break\n    end\n  end\n  if f then print(ic) break end\nend\nif not f then print(-1) end\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s746286809", "group_id": "codeNet:p02761", "input_text": "local n, m = io.read(\"*n\", \"*n\")\nlocal min, max = 1, 9\nif n == 2 then\n  min, max = 10, 99\nelseif n == 3 then\n  min, max = 100, 999\nend\nlocal s, c = {}, {}\nfor i = 1, m do\n  local x, y = io.read(\"*n\", \"*n\")\n  s[i], c[i] = x, tostring(y)\nend\nlocal f = false\nfor ic = min, max do\n  local str = tostring(ic)\n  f = true\n  for i = 1, m do\n    if n < s[i] or str:sub(s[i], s[i]) ~= c[i] then\n      f = false\n      break\n    end\n  end\n  if f then print(ic) break end\nend\nif not f then print(-1) end\n", "language": "Lua", "metadata": {"date": 1583114829, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lua/s746286809.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s746286809", "user_id": "u120582723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "local n, m = io.read(\"*n\", \"*n\")\nlocal min, max = 1, 9\nif n == 2 then\n  min, max = 10, 99\nelseif n == 3 then\n  min, max = 100, 999\nend\nlocal s, c = {}, {}\nfor i = 1, m do\n  local x, y = io.read(\"*n\", \"*n\")\n  s[i], c[i] = x, tostring(y)\nend\nlocal f = false\nfor ic = min, max do\n  local str = tostring(ic)\n  f = true\n  for i = 1, m do\n    if n < s[i] or str:sub(s[i], s[i]) ~= c[i] then\n      f = false\n      break\n    end\n  end\n  if f then print(ic) break end\nend\nif not f then print(-1) end\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s487154368", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    local curj = #plus\n    for i = 1, #minus do\n      local dst = x / minus[i]\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = #plus + 1\n      for j = curj, 1, -1 do\n        if dst <= plus[j] then\n          z = j\n        else break end\n      end\n      curj = mmi(#plus, z)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    right = #plus\n    curj = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        local dst = x / plus[i]\n        z = curj + 1\n        for j = curj, i + 1, -1 do\n          if dst < plus[j] then\n            z = j\n          else\n            break\n          end\n        end\n        curj = mmi(#plus, z)\n        z = z - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581894603, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s487154368.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487154368", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    local curj = #plus\n    for i = 1, #minus do\n      local dst = x / minus[i]\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = #plus + 1\n      for j = curj, 1, -1 do\n        if dst <= plus[j] then\n          z = j\n        else break end\n      end\n      curj = mmi(#plus, z)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    right = #plus\n    curj = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        local dst = x / plus[i]\n        z = curj + 1\n        for j = curj, i + 1, -1 do\n          if dst < plus[j] then\n            z = j\n          else\n            break\n          end\n        end\n        curj = mmi(#plus, z)\n        z = z - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2760, "cpu_time_ms": 1498, "memory_kb": 21660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s967620013", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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 n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    right = #plus\n    curj = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        local dst = x / plus[i]\n        z = curj + 1\n        for j = curj, i + 1, -1 do\n          if dst < plus[j] then\n            z = j\n          else\n            break\n          end\n        end\n        curj = mmi(#plus, z)\n        z = z - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581894281, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s967620013.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s967620013", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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 n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    right = #plus\n    curj = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        local dst = x / plus[i]\n        z = curj + 1\n        for j = curj, i + 1, -1 do\n          if dst < plus[j] then\n            z = j\n          else\n            break\n          end\n        end\n        curj = mmi(#plus, z)\n        z = z - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2999, "cpu_time_ms": 2104, "memory_kb": 21660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s786036102", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      -- g_tgt = x / minus[i]\n      -- local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      -- right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581893930, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s786036102.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s786036102", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solve(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    local curj = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / minus[i]\n      local z = curj + 1\n      for j = curj, i + 1, -1 do\n        if dst < minus[j] then\n          z = j\n        else\n          break\n        end\n      end\n      curj = mmi(#minus, z)\n      z = z - 1\n      -- g_tgt = x / minus[i]\n      -- local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      -- right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    local r = solveA(mid)\n    if k <= r then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3355, "cpu_time_ms": 2104, "memory_kb": 21788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s324940191", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solve(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solveA(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581892585, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s324940191.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s324940191", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solve(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solveA(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3911, "cpu_time_ms": 2104, "memory_kb": 22516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s689613500", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solveA(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581892344, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s689613500.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s689613500", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  local mid = (min + max) / 2LL\n  while 1LL < max - min do\n    local r = solveA(mid)\n    if max - min < 10LL then\n      if k <= r then\n        max = mid\n      else\n        min = mid\n      end\n      mid = (min + max) / 2LL\n    else\n      if k <= r then\n        max = mid\n        if k * 10 < r then\n          mid = (min * 3 + max) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      else\n        min = mid\n        if r * 10 < k then\n          mid = (min + max * 3) / 4LL\n        else\n          mid = (min + max) / 2LL\n        end\n      end\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3485, "cpu_time_ms": 2105, "memory_kb": 22520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s622925544", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581891533, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s622925544.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s622925544", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal g_tgt = 0LL\nlocal function upper_bound(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (g_tgt < ary[left] ) then return left end\n  if not (g_tgt < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (g_tgt < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % minus[i] ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      g_tgt = x / minus[i]\n      local z = upper_bound(minus, i + 1, right) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        else\n          z = right\n        end\n      else\n        g_tgt = x / plus[i]\n        z = upper_bound(plus, i + 1, right) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3059, "cpu_time_ms": 2105, "memory_kb": 22520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s886960979", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal function upper_bound(ary, left, right, x)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      local tmp = tostring(dst):gsub(\"LL\", \"\")\n      dst = tonumber(tmp)\n      if x % (0LL + minus[i]) ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local tmp = tostring(dst):gsub(\"LL\", \"\")\n      dst = tonumber(tmp)\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581889620, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s886960979.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s886960979", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal function upper_bound(ary, left, right, x)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      local tmp = tostring(dst):gsub(\"LL\", \"\")\n      dst = tonumber(tmp)\n      if x % (0LL + minus[i]) ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local tmp = tostring(dst):gsub(\"LL\", \"\")\n      dst = tonumber(tmp)\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3267, "cpu_time_ms": 2105, "memory_kb": 21816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s680725884", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal function upper_bound(ary, left, right, x)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % (0LL + minus[i]) ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581889500, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s680725884.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s680725884", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal function lower_bound(ary, x, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (ary[1] < x) then return 1 end\n  if (ary[right] < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((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\nlocal function upper_bound(ary, left, right, x)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local dst = x / (0LL + minus[i])\n      if x % (0LL + minus[i]) ~= 0 then dst = dst + 1 end\n      local z = lower_bound(plus, dst, right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3121, "cpu_time_ms": 2104, "memory_kb": 22528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s699138615", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if (1LL*ary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal function upper_bound3(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (0 < ary[left] ) then return left end\n  if not (0 < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (0 < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n        -- z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581889094, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s699138615.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s699138615", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if (1LL*ary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal function upper_bound3(ary, left, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (0 < ary[left] ) then return left end\n  if not (0 < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (0 < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = 0\n      if plus[i] == 0 then\n        if x < 0 then\n          z = i\n        elseif x == 0 then\n          z = right\n        else\n          z = right\n        end\n        -- z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      else\n        local dst = x / (0LL + plus[i])\n        z = upper_bound(plus, i + 1, right, dst) - 1\n      end\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4011, "cpu_time_ms": 2104, "memory_kb": 22532}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s393269562", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if (1LL*ary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581888658, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s393269562.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s393269562", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if (1LL*ary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3333, "cpu_time_ms": 2104, "memory_kb": 22520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s089049866", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*aary[1] * mul < x) then return 1 end\n  if (1LL*aary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*aary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581888466, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s089049866.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s089049866", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\nlocal g_tgt = 0\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*aary[1] * mul < x) then return 1 end\n  if (1LL*aary[right] * mul < x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*aary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x)\n  -- local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < ary[left] ) then return left end\n  if not (x < ary[right] ) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < ary[mid] ) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound2(ary, left, right, mul)\n  local x = g_tgt\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL*ary[left] *mul) then return left end\n  if not (x < 1LL*ary[right] *mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] *mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, 0LL+ minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    g_tgt = x\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local dst = x / (0LL + minus[i])\n      local z = upper_bound(minus, i + 1, right, dst) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound2(plus, i + 1, right, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3336, "cpu_time_ms": 1139, "memory_kb": 22524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s902769788", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if 1LL*ary[right] * mul < x then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL* ary[left] * mul) then return left end\n  if not (x < 1LL*ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\n-- for i = 1, n do\n--   t[i] = io.read(\"*n\")\n-- end\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581887147, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s902769788.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s902769788", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "local mfl = math.floor\n\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not (1LL*ary[1] * mul < x) then return 1 end\n  if 1LL*ary[right] * mul < x then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if (1LL*ary[mid] * mul < x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if (x < 1LL* ary[left] * mul) then return left end\n  if not (x < 1LL*ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not (x < 1LL*ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nlocal str = io.read()\nfor s in str:gmatch(\"(-?%d+)\") do\n  table.insert(t, tonumber(s))\nend\n-- for i = 1, n do\n--   t[i] = io.read(\"*n\")\n-- end\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2895, "cpu_time_ms": 2104, "memory_kb": 13716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s674539059", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(1LL*ary[1] * mul, x) then return 1 end\n  if comp(1LL*ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(1LL*ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, 1LL* ary[left] * mul) then return left end\n  if not comp(x, 1LL*ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, 1LL*ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581886639, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s674539059.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s674539059", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(1LL*ary[1] * mul, x) then return 1 end\n  if comp(1LL*ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(1LL*ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, 1LL* ary[left] * mul) then return left end\n  if not comp(x, 1LL*ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, 1LL*ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2855, "cpu_time_ms": 2103, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s566708037", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581886366, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s566708037.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s566708037", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local mmi = math.min\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2836, "cpu_time_ms": 2104, "memory_kb": 16116}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s046378427", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581886324, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s046378427.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s046378427", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul, right)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[right] * mul, x) then return right + 1 end\n  local min, max = 1, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if comp(ary[mid] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    local right = #plus\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i], right)\n      cnt = cnt + (#plus + 1 - z)\n      if z == 1 then\n        cnt = cnt + (#minus - i) * #plus\n        break\n      else\n        right = mmi(z, #plus)\n      end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2813, "cpu_time_ms": 1376, "memory_kb": 16240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s200922620", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581885677, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s200922620.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s200922620", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2642, "cpu_time_ms": 2104, "memory_kb": 16240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s580741537", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n      if #plus + 1 - z == 0 then break end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581885533, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s580741537.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s580741537", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, right, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[right] * mul) then return right + 1 end\n  local min, max = left, right\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n      if #plus + 1 - z == 0 then break end\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  local mmi = math.min\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    local right = #minus\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, right, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #minus)\n    end\n    right = #plus\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, right, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n      right = mmi(z + 1, #plus)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2685, "cpu_time_ms": 1748, "memory_kb": 16116}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s162710809", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[num] * mul) then return num + 1 end\n  local min, max = left, num\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581885265, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s162710809.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s162710809", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[num] * mul) then return num + 1 end\n  local min, max = left, num\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ndo\n  local hn = math.floor(#plus / 2)\n  for i = 1, hn do\n    plus[i], plus[#plus + 1 - i] = plus[#plus + 1 - i], plus[i]\n  end\nend\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n      if z - i == 0 then break end\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2484, "cpu_time_ms": 2104, "memory_kb": 16240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s921500989", "group_id": "codeNet:p02774", "input_text": "local mfl = math.floor\n\nlocal function comp(a, b)\n  return a < b\nend\n\nlocal function lower_bound(ary, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[num] * mul) then return num + 1 end\n  local min, max = left, num\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ntable.sort(minus)\ntable.sort(plus)\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n    end\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "language": "Lua", "metadata": {"date": 1581884936, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lua/s921500989.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s921500989", "user_id": "u120582723"}, "prompt_components": {"gold_output": "-6\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, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if not comp(ary[1] * mul, x) then return 1 end\n  if comp(ary[num] * mul, 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] * mul, x) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\nlocal function upper_bound(ary, left, x, mul)\n  local num = #ary\n  if num == 0 then return 1 end\n  if comp(x, ary[left] * mul) then return left end\n  if not comp(x, ary[num] * mul) then return num + 1 end\n  local min, max = left, num\n  while 1 < max - min do\n    local mid = mfl((min + max) / 2)\n    if not comp(x, ary[mid] * mul) then\n      min = mid\n    else\n      max = mid\n    end\n  end\n  return max\nend\n\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = 0LL + io.read(\"*n\")\nend\ntable.sort(t)\nlocal plus_start_pos = n + 1\nlocal minus, plus = {}, {}\nfor i = n, 1, -1 do\n  if t[i] < 0 then\n    table.insert(minus, -t[i])\n  else\n    table.insert(plus, t[i])\n    plus_start_pos = i\n  end\nend\ntable.sort(minus)\ntable.sort(plus)\nlocal ten9 = 1000000000LL\nlocal minus_cnt = #minus * #plus\nif k <= minus_cnt then\n  local function solve(x)\n    x = -x\n    local cnt = 0\n    for i = 1, #minus do\n      local z = lower_bound(plus, x, minus[i])\n      cnt = cnt + (#plus + 1 - z)\n    end\n    return k <= cnt\n  end\n  local max = 1LL\n  local min = -ten9 * ten9 - 1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solve(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nelse\n  k = k - minus_cnt\n  local function solveA(x)\n    local cnt = 0\n    for i = 1, #minus - 1 do\n      local z = upper_bound(minus, i + 1, x, minus[i]) - 1\n      cnt = cnt + (z - i)\n    end\n    for i = 1, #plus - 1 do\n      local z = upper_bound(plus, i + 1, x, plus[i]) - 1\n      cnt = cnt + (z - i)\n    end\n    return k <= cnt\n  end\n  local max = ten9 * ten9 + 1LL\n  local min = -1LL\n  while 1LL < max - min do\n    local mid = (min + max) / 2LL\n    if solveA(mid) then\n      max = mid\n    else\n      min = mid\n    end\n  end\n  local str = tostring(max):gsub(\"LL\", \"\")\n  print(str)\nend\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\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 K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2318, "cpu_time_ms": 2104, "memory_kb": 16240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s267286122", "group_id": "codeNet:p02879", "input_text": "\nlocal arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr + 1] = tonumber(token)\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend\n", "language": "Lua", "metadata": {"date": 1594084076, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s267286122.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s267286122", "user_id": "u089230684"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "\nlocal arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr + 1] = tonumber(token)\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s258921813", "group_id": "codeNet:p02879", "input_text": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr + 1] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "language": "Lua", "metadata": {"date": 1594083975, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s258921813.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s258921813", "user_id": "u089230684"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr + 1] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s227913015", "group_id": "codeNet:p02879", "input_text": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "language": "Lua", "metadata": {"date": 1594083935, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s227913015.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s227913015", "user_id": "u018679195"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s484067017", "group_id": "codeNet:p02879", "input_text": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr_i] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "language": "Lua", "metadata": {"date": 1594083899, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s484067017.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s484067017", "user_id": "u353919145"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local arr = {}\nlocal arr_temp = io.read()\nfor token in string.gmatch(arr_temp, \"[^%s]+\") do\n   arr[#arr_i] = token\nend\nlocal a, b = arr[1], arr[2]\n\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 207, "cpu_time_ms": 5, "memory_kb": 2796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s035870626", "group_id": "codeNet:p02879", "input_text": "local a, b = io.read(\"*n\", \"*n\", \"*l\")\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend\n", "language": "Lua", "metadata": {"date": 1594083770, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s035870626.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035870626", "user_id": "u353919145"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\", \"*l\")\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s478112146", "group_id": "codeNet:p02879", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nio.read()\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "language": "Lua", "metadata": {"date": 1594083685, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s478112146.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s478112146", "user_id": "u863370423"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nio.read()\nif a <= 9 and b <= 9 then\n\tprint(a * b)\nelse\n\tprint(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s497525806", "group_id": "codeNet:p02879", "input_text": "A=io.read\"*n\"\nB=io.read\"*n\"\nprint((\n\tA<=9 and B<=9\n)and A*B or -1)", "language": "Lua", "metadata": {"date": 1587769250, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s497525806.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497525806", "user_id": "u726173718"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "A=io.read\"*n\"\nB=io.read\"*n\"\nprint((\n\tA<=9 and B<=9\n)and A*B or -1)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s671250550", "group_id": "codeNet:p02879", "input_text": "a,b=io.read(\"*n\",\"*n\")\nif a<10 and b<10 then\n  print(a*b)\nelse\n  print(-1)\nend", "language": "Lua", "metadata": {"date": 1579279573, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s671250550.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s671250550", "user_id": "u720483676"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nif a<10 and b<10 then\n  print(a*b)\nelse\n  print(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s576158707", "group_id": "codeNet:p02879", "input_text": "local a,b,x=io.read(\"*n\",\"*n\",\"*n\")\nif a*a*b/2<=x then\n  print(math.atan(2*(a*a*b-x)/(a*a*a))*180/math.pi)\nelse\n  print((math.pi/2 - math.atan(2*x/(a*b*b)))*180/math.pi)\nend", "language": "Lua", "metadata": {"date": 1576559029, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s576158707.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s576158707", "user_id": "u373958718"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a,b,x=io.read(\"*n\",\"*n\",\"*n\")\nif a*a*b/2<=x then\n  print(math.atan(2*(a*a*b-x)/(a*a*a))*180/math.pi)\nelse\n  print((math.pi/2 - math.atan(2*x/(a*b*b)))*180/math.pi)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s246991797", "group_id": "codeNet:p02879", "input_text": "local n=io.read(\"*n\")\nfor i=1,9 do\n  for j=1,9 do\n    if i*j==n then\n      return print(\"Yes\")\n    end\n  end\nend\nprint(\"No\")", "language": "Lua", "metadata": {"date": 1576557031, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s246991797.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s246991797", "user_id": "u373958718"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local n=io.read(\"*n\")\nfor i=1,9 do\n  for j=1,9 do\n    if i*j==n then\n      return print(\"Yes\")\n    end\n  end\nend\nprint(\"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s169858140", "group_id": "codeNet:p02879", "input_text": "local a,b=io.read(\"*n\",\"*n\")\nif a>9 or b>9 then\n  print(-1)\nelse\n  print(a*b)\nend", "language": "Lua", "metadata": {"date": 1576450628, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s169858140.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169858140", "user_id": "u373958718"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a,b=io.read(\"*n\",\"*n\")\nif a>9 or b>9 then\n  print(-1)\nelse\n  print(a*b)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s182377071", "group_id": "codeNet:p02879", "input_text": "local a,b=io.read(\"*n\",\"*n\")\nif a>9 or b>9 then\n  print(-1)\nelse\n  print(a*b)\nend", "language": "Lua", "metadata": {"date": 1576450620, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s182377071.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182377071", "user_id": "u373958718"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a,b=io.read(\"*n\",\"*n\")\nif a>9 or b>9 then\n  print(-1)\nelse\n  print(a*b)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s079708907", "group_id": "codeNet:p02879", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nif a > 9 or b > 9 then\n\tprint(-1)\nelse\n\tprint(a * b)\nend", "language": "Lua", "metadata": {"date": 1572995293, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s079708907.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079708907", "user_id": "u413686817"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nif a > 9 or b > 9 then\n\tprint(-1)\nelse\n\tprint(a * b)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s013201022", "group_id": "codeNet:p02879", "input_text": "local a,b,c,d = io.read(1,1,1,1)\nif b == ' ' and d == '\\n' then\n    print(math.floor(a*c))\nelse\n    print(-1)\nend", "language": "Lua", "metadata": {"date": 1572235218, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s013201022.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013201022", "user_id": "u162773977"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "local a,b,c,d = io.read(1,1,1,1)\nif b == ' ' and d == '\\n' then\n    print(math.floor(a*c))\nelse\n    print(-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s911777745", "group_id": "codeNet:p02879", "input_text": "    n=io.read(\"*n\")\n    \t\n    ans=n-1\n         \n    for i=2, 9 do\n      if n%i==0 then\n        ans=(n/i)+i-2\n      end\n    end\n\n\tprint(ans)", "language": "Lua", "metadata": {"date": 1572232437, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s911777745.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s911777745", "user_id": "u535423069"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "    n=io.read(\"*n\")\n    \t\n    ans=n-1\n         \n    for i=2, 9 do\n      if n%i==0 then\n        ans=(n/i)+i-2\n      end\n    end\n\n\tprint(ans)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s557429092", "group_id": "codeNet:p02879", "input_text": "    a=io.read(\"*n\")\n    b=io.read(\"*n\")\n     \n    if a < 10 and b < 10 then\n      print(a*b)\n    else\n      print(-1)\n    end", "language": "Lua", "metadata": {"date": 1572225051, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lua/s557429092.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s557429092", "user_id": "u535423069"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "    a=io.read(\"*n\")\n    b=io.read(\"*n\")\n     \n    if a < 10 and b < 10 then\n      print(a*b)\n    else\n      print(-1)\n    end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\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 Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s328522423", "group_id": "codeNet:p02891", "input_text": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal t = {}\nlocal left = 1\nfor i = 2, #s do\n  if s:byte(i) ~= s:byte(left) then\n    table.insert(t, i - left)\n    left = i\n  end\nend\ntable.insert(t, #s + 1 - left)\nif #t == 1 then\n  local tot = k * #s\n  print(tot // 2)\nelseif s:byte(1, 1) == s:byte(#s, #s) then\n  local first = t[1]\n  local last = t[#t]\n  local ret = 0\n  for i = 2, #t - 1 do\n    ret = ret + t[i] // 2\n  end\n  ret = ret * k + first // 2 + last // 2\n  ret = ret + ((first + last) // 2) * (k - 1)\n  print(ret)\nelse\n  local ret = 0\n  for i = 1, #t do\n    ret = ret + t[i] // 2\n  end\n  print(ret * k)\nend\n", "language": "Lua", "metadata": {"date": 1597626531, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s328522423.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328522423", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal t = {}\nlocal left = 1\nfor i = 2, #s do\n  if s:byte(i) ~= s:byte(left) then\n    table.insert(t, i - left)\n    left = i\n  end\nend\ntable.insert(t, #s + 1 - left)\nif #t == 1 then\n  local tot = k * #s\n  print(tot // 2)\nelseif s:byte(1, 1) == s:byte(#s, #s) then\n  local first = t[1]\n  local last = t[#t]\n  local ret = 0\n  for i = 2, #t - 1 do\n    ret = ret + t[i] // 2\n  end\n  ret = ret * k + first // 2 + last // 2\n  ret = ret + ((first + last) // 2) * (k - 1)\n  print(ret)\nelse\n  local ret = 0\n  for i = 1, #t do\n    ret = ret + t[i] // 2\n  end\n  print(ret * k)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 613, "cpu_time_ms": 10, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s233857930", "group_id": "codeNet:p02891", "input_text": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,1,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s then\n    print(#s*k//2)\nelseif a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "language": "Lua", "metadata": {"date": 1590496406, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s233857930.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233857930", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,1,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s then\n    print(#s*k//2)\nelseif a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 546, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s949713562", "group_id": "codeNet:p02891", "input_text": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,1,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s or a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "language": "Lua", "metadata": {"date": 1590495988, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s949713562.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s949713562", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,1,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s or a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 518, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s420556511", "group_id": "codeNet:p02891", "input_text": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s-1 do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,2,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s or a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "language": "Lua", "metadata": {"date": 1590495840, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s420556511.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s420556511", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\n\nlocal a=0\nlocal b=0\nif t[1]==t[#s] then\n    for i=1,#s-1 do\n        a=a+1\n        if t[i]~=t[i+1] then\n            break\n        end\n    end\n    for i=#s,2,-1 do\n        b=b+1\n        if t[i]~=t[i-1] then\n            break\n        end\n    end\nend\n\nlocal c=0\nfor i=1,#s-1 do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        c=c+1\n    end\nend\n\nif a==#s or a==0 then\n    print(c*k)\nelse\n    print(c*k-(a//2+b//2-(a+b)//2)*(k-1))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s188439224", "group_id": "codeNet:p02891", "input_text": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\nt[#s+1]=s:sub(1,1)\n\nlocal counter=0\nfor i=1,#s do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        counter=counter+1\n    end\nend\nprint(counter*k)", "language": "Lua", "metadata": {"date": 1590493409, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s188439224.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s188439224", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s=io.read()\nlocal k=io.read(\"n\")\n\nlocal t={}\nfor i=1,#s do\n    t[i]=s:sub(i,i)\nend\nt[#s+1]=s:sub(1,1)\n\nlocal counter=0\nfor i=1,#s do\n    if t[i]==t[i+1] then\n        t[i+1]=0\n        counter=counter+1\n    end\nend\nprint(counter*k)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 235, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s797600456", "group_id": "codeNet:p02891", "input_text": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\ns = s .. s\nlocal t = {}\nfor i = 1, 2 * n do\n  t[i] = s:sub(i, i)\nend\nlocal spos = 1\nfor i = 1, n - 1 do\n  if t[i] ~= t[i + 1] then\n    spos = i + 1\n    break\n  end\nend\nif spos == 1 then\n  print(math.floor(n * k / 2))\nelse\n  local edgelen = spos - 1\n  local epos = n\n  local ecnt = 0\n  for i = n, 1, -1 do\n    if t[1] == t[i] then\n      ecnt = ecnt + 1\n    else\n      epos = i\n      break\n    end\n  end\n  edgelen = edgelen + ecnt\n  local intcost = 0\n  local len = 1\n  for i = spos + 1, epos do\n    if t[i] == t[i - 1] then\n      len = len + 1\n      if len % 2 == 0 then\n        intcost = intcost + 1\n      end\n    else\n      len = 1\n    end\n    -- print(i, len)\n  end\n  local edgecost = math.floor(edgelen / 2)\n  -- print(intcost)\n  -- print(intcost * k + edgecost * (k - 1))\n  -- print(edgecost)\n  -- print(intcost * k, edgecost * (k - 1),  math.floor((spos - 1) / 2) , math.floor(ecnt / 2))\n  print(intcost * k + edgecost * (k - 1) + math.floor((spos - 1) / 2) + math.floor(ecnt / 2))\nend\n--  8999939997\n-- 11999919996\n", "language": "Lua", "metadata": {"date": 1570325838, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s797600456.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797600456", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\ns = s .. s\nlocal t = {}\nfor i = 1, 2 * n do\n  t[i] = s:sub(i, i)\nend\nlocal spos = 1\nfor i = 1, n - 1 do\n  if t[i] ~= t[i + 1] then\n    spos = i + 1\n    break\n  end\nend\nif spos == 1 then\n  print(math.floor(n * k / 2))\nelse\n  local edgelen = spos - 1\n  local epos = n\n  local ecnt = 0\n  for i = n, 1, -1 do\n    if t[1] == t[i] then\n      ecnt = ecnt + 1\n    else\n      epos = i\n      break\n    end\n  end\n  edgelen = edgelen + ecnt\n  local intcost = 0\n  local len = 1\n  for i = spos + 1, epos do\n    if t[i] == t[i - 1] then\n      len = len + 1\n      if len % 2 == 0 then\n        intcost = intcost + 1\n      end\n    else\n      len = 1\n    end\n    -- print(i, len)\n  end\n  local edgecost = math.floor(edgelen / 2)\n  -- print(intcost)\n  -- print(intcost * k + edgecost * (k - 1))\n  -- print(edgecost)\n  -- print(intcost * k, edgecost * (k - 1),  math.floor((spos - 1) / 2) , math.floor(ecnt / 2))\n  print(intcost * k + edgecost * (k - 1) + math.floor((spos - 1) / 2) + math.floor(ecnt / 2))\nend\n--  8999939997\n-- 11999919996\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1077, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s178265127", "group_id": "codeNet:p02891", "input_text": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\ns = s .. s\nlocal t = {}\nfor i = 1, 2 * n do\n  t[i] = s:sub(i, i)\nend\nlocal spos = 1\nfor i = 1, n - 1 do\n  if t[i] ~= t[i + 1] then\n    spos = i + 1\n    break\n  end\nend\nif spos == 1 then\n  print(math.floor(n * k / 2))\nelse\n  local edgelen = spos - 1\n  local epos = n\n  local ecnt = 0\n  for i = n, 1, -1 do\n    if t[1] == t[i] then\n      ecnt = ecnt + 1\n    else\n      epos = i\n      break\n    end\n  end\n  edgelen = edgelen + ecnt\n  local intcost = 0\n  local len = 1\n  for i = spos + 1, epos do\n    if t[i] == t[i - 1] then\n      len = len + 1\n      if len % 2 == 0 then\n        intcost = intcost + 1\n      end\n    else\n      len = 1\n    end\n    -- print(i, len)\n  end\n  local edgecost = math.floor(len / 2)\n  -- print(intcost)\n  -- print(intcost * k + edgecost * (k - 1))\n  print(intcost * k + edgecost * (k - 1) + math.floor((spos - 1) / 2) + math.floor(ecnt / 2))\nend\n--  8999939997\n-- 11999919996\n", "language": "Lua", "metadata": {"date": 1570325688, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lua/s178265127.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s178265127", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local s = io.read()\nlocal k = io.read(\"*n\")\nlocal n = #s\ns = s .. s\nlocal t = {}\nfor i = 1, 2 * n do\n  t[i] = s:sub(i, i)\nend\nlocal spos = 1\nfor i = 1, n - 1 do\n  if t[i] ~= t[i + 1] then\n    spos = i + 1\n    break\n  end\nend\nif spos == 1 then\n  print(math.floor(n * k / 2))\nelse\n  local edgelen = spos - 1\n  local epos = n\n  local ecnt = 0\n  for i = n, 1, -1 do\n    if t[1] == t[i] then\n      ecnt = ecnt + 1\n    else\n      epos = i\n      break\n    end\n  end\n  edgelen = edgelen + ecnt\n  local intcost = 0\n  local len = 1\n  for i = spos + 1, epos do\n    if t[i] == t[i - 1] then\n      len = len + 1\n      if len % 2 == 0 then\n        intcost = intcost + 1\n      end\n    else\n      len = 1\n    end\n    -- print(i, len)\n  end\n  local edgecost = math.floor(len / 2)\n  -- print(intcost)\n  -- print(intcost * k + edgecost * (k - 1))\n  print(intcost * k + edgecost * (k - 1) + math.floor((spos - 1) / 2) + math.floor(ecnt / 2))\nend\n--  8999939997\n-- 11999919996\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 956, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s383399622", "group_id": "codeNet:p02912", "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a,d)\n    local b=a and a[4]\n    if b then\n        local c=b[4]\n        a=meld(a,b)\n        a[4]=d\n        d=a\n        return pair(c,d)\n    else\n        local e\n        while d do\n            e=d\n            d=d[4]\n            a=meld(a,e)\n        end\n        return a\n    end\nend\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3],false)\nend\n\nPairingHeap.join=function(self,other)\n    self[1]=meld(self[1],other[1])\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={false}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n\nfor i=1,m do\n    local x=a:top()\n    x=(x//2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1601186110, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s383399622.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s383399622", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a,d)\n    local b=a and a[4]\n    if b then\n        local c=b[4]\n        a=meld(a,b)\n        a[4]=d\n        d=a\n        return pair(c,d)\n    else\n        local e\n        while d do\n            e=d\n            d=d[4]\n            a=meld(a,e)\n        end\n        return a\n    end\nend\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3],false)\nend\n\nPairingHeap.join=function(self,other)\n    self[1]=meld(self[1],other[1])\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={false}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n\nfor i=1,m do\n    local x=a:top()\n    x=(x//2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1364, "cpu_time_ms": 499, "memory_kb": 29160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s461382271", "group_id": "codeNet:p02912", "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a,d)\n    local b=a and a[4]\n    if b then\n        local c=b[4]\n        a=meld(a,b)\n        a[4]=d\n        d=a\n        return pair(c,d)\n    else\n        local e\n        while d do\n            e=d\n            d=d[4]\n            a=meld(a,e)\n        end\n        return a\n    end\nend\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3],false)\nend\n\nPairingHeap.join=function(self,other)\n    self[1]=meld(self[1],other[1])\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={false}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=math.floor(x/2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(string.format(\"%d\",total))", "language": "Lua", "metadata": {"date": 1601185991, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s461382271.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s461382271", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a,d)\n    local b=a and a[4]\n    if b then\n        local c=b[4]\n        a=meld(a,b)\n        a[4]=d\n        d=a\n        return pair(c,d)\n    else\n        local e\n        while d do\n            e=d\n            d=d[4]\n            a=meld(a,e)\n        end\n        return a\n    end\nend\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3],false)\nend\n\nPairingHeap.join=function(self,other)\n    self[1]=meld(self[1],other[1])\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={false}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=math.floor(x/2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(string.format(\"%d\",total))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1394, "cpu_time_ms": 126, "memory_kb": 18072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s532078809", "group_id": "codeNet:p02912", "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a)\n    local b,c,d,e\n    while a do\n        c=false\n        b=a\n        a=a[4]\n        b[4]=false\n        if a then\n            c=a\n            a=a[4]   \n            c[4]=false\n        end\n        b=meld(b,c)\n        b[4]=d\n        d=b\n    end\n    while d do\n        e=d\n        d=d[4]\n        a=meld(a,e)\n    end\n    return a\nend\n\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3])\nend\n\nPairingHeap.join=function(self,other)\n    if self[1][1]<other[1][1]then\n\t\tother[1][4]=self[1][3]\n        self[1][3]=other[1]\n\telse\n\t\tself[1][4]=other[1][3]\n        other[1][3]=self[1]\n        self[1]=other[1]\n    end\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n \nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=math.floor(x/2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(string.format(\"%d\",total))", "language": "Lua", "metadata": {"date": 1600447426, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s532078809.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532078809", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a)\n    local b,c,d,e\n    while a do\n        c=false\n        b=a\n        a=a[4]\n        b[4]=false\n        if a then\n            c=a\n            a=a[4]   \n            c[4]=false\n        end\n        b=meld(b,c)\n        b[4]=d\n        d=b\n    end\n    while d do\n        e=d\n        d=d[4]\n        a=meld(a,e)\n    end\n    return a\nend\n\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3])\nend\n\nPairingHeap.join=function(self,other)\n    if self[1][1]<other[1][1]then\n\t\tother[1][4]=self[1][3]\n        self[1][3]=other[1]\n\telse\n\t\tself[1][4]=other[1][3]\n        other[1][3]=self[1]\n        self[1]=other[1]\n    end\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n \nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=math.floor(x/2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(string.format(\"%d\",total))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1581, "cpu_time_ms": 132, "memory_kb": 18232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s818153284", "group_id": "codeNet:p02912", "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a)\n    local b,c,d,e\n    while a do\n        c=false\n        b=a\n        a=a[4]\n        b[4]=false\n        if a then\n            c=a\n            a=a[4]   \n            c[4]=false\n        end\n        b=meld(b,c)\n        b[4]=d\n        d=b\n    end\n    while d do\n        e=d\n        d=d[4]\n        a=meld(a,e)\n    end\n    return a\nend\n\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3])\nend\n\nPairingHeap.join=function(self,other)\n    if self[1][1]<other[1][1]then\n\t\tother[1][4]=self[1][3]\n        self[1][3]=other[1]\n\telse\n\t\tself[1][4]=other[1][3]\n        other[1][3]=self[1]\n        self[1]=other[1]\n    end\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n \nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=(x//2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1600447350, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s818153284.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s818153284", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "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]<b[1] then\n        b[4]=a[3]\n        a[3]=b\n        return a\n    else\n        a[4]=b[3]\n        b[3]=a\n        return b\n    end\nend\n\nlocal function pair(a)\n    local b,c,d,e\n    while a do\n        c=false\n        b=a\n        a=a[4]\n        b[4]=false\n        if a then\n            c=a\n            a=a[4]   \n            c[4]=false\n        end\n        b=meld(b,c)\n        b[4]=d\n        d=b\n    end\n    while d do\n        e=d\n        d=d[4]\n        a=meld(a,e)\n    end\n    return a\nend\n\n\nlocal PairingHeap={}\n\nPairingHeap.empty=function(self)\n    return not self[1]\nend\n\nPairingHeap.push=function(self,key,value)\n    self[1]=meld(self[1],{key,value,false,false})\nend\n\nPairingHeap.top=function(self)\n    return self[1][2]\nend\n\nPairingHeap.pop=function(self)\n    self[1]=pair(self[1][3])\nend\n\nPairingHeap.join=function(self,other)\n    if self[1][1]<other[1][1]then\n\t\tother[1][4]=self[1][3]\n        self[1][3]=other[1]\n\telse\n\t\tself[1][4]=other[1][3]\n        other[1][3]=self[1]\n        self[1]=other[1]\n    end\n    return self\nend\n\nPairingHeap.new=function(self)\n    local obj={}\n    setmetatable(obj,{__index=PairingHeap})\n    return obj\nend\n\n----------\n \nlocal n,m=io.read(\"n\",\"n\")\nlocal a=PairingHeap:new()\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:push(-input,input)\nend\n \nfor i=1,m do\n    local x=a:top()\n    x=(x//2)\n    a:pop()\n    a:push(-x,x)\nend\n \nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1552, "cpu_time_ms": 470, "memory_kb": 29200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s894641910", "group_id": "codeNet:p02912", "input_text": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/2\n\n----------\n\n--[[\n\tPairing Min Heap\n\t\n\tBinary Heap is faster for increasing and random pushes but this is faster for joining (merging) and decreasing pushes\n\tIt is very optimized\n\t\n\tUse Kill to GC after finished using\n\t\n--]]\n\n--[[\n\tNode: {\n\tKey,\n\tLeftChild,\n\tNextSibling,\n\t}\n\t\n--]]\n\n-- Constants\n\n-- cached variables\n\n-- local variables\n\nlocal tables={}\nlocal tSize=0\n\nlocal function merge(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[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\t\t\n\t\treturn a\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\treturn b\n\tend\nend\n\nlocal function twopassmerge(a)\n\tlocal b=a and a[3]\n\tif b then\n\t\tlocal newnode=b[3]\n\t\t\n\t\ta[3]=false\n\t\tb[3]=false\n\t\t\n\t\treturn merge(merge(a,b),twopassmerge(newnode))\n\telse\n\t\treturn a\n\tend\nend\n\nlocal function empty(heap)\n\treturn not heap.root\nend\n\nlocal function top(heap)\n\treturn heap.root[1]\nend\n\nlocal function push(heap,key)\n\tlocal root=heap.Size+1\n\theap.Size=root\n\tlocal t=heap.maxSize\n\theap.maxSize=(root>t and root)or t\n\t\n\t-- inlined merge (optimized for insert)\n\troot=heap.root\n\tif not root then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\telseif root[1]<key then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[3]=root[2]\n\t\t\troot[2]=t\n\t\telse\n\t\t\troot[2]={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\troot[2],\n\t\t\t}\n\t\tend\n\telse\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[2]=root\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\troot,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\tend\nend\n\nlocal function pop(heap)\n\theap.Size=heap.Size-1\n\tlocal root=heap.root\n\theap.root=twopassmerge(root[2])\n\troot[1]=false\n\troot[2]=false\n\troot[3]=false\n\ttSize=tSize+1\n\ttables[tSize]=root\nend\n\nlocal function join(heap1,heap2)\n\t-- assumes non empty heaps\n\t-- don't kill heap2 after merging\n\t\n\tlocal a=heap1.Size+heap2.Size\n\theap1.Size=a\n\tlocal b=heap1.maxSize\n\theap1.maxSize=(a>b and a)or b\n\t\n\ta=heap1.root\n\tb=heap2.root\n\t\n\t-- inlined merge\n\tif a[1]<b[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\theap1.root=b\n\tend\n\t\n\treturn heap1\nend\n\nlocal function kill(heap)\n\tlocal nt=tSize-heap.maxSize+heap.Size\n\tfor i=nt+1,tSize do\n\t\ttables[i]=nil\n\tend\n\ttSize=nt\nend\n\nlocal heap={\n\tempty=empty,\n\ttop=top,\n\tpush=push,\n\tpop=pop,\n\tjoin=join,\n\tkill=kill,\n}\n\nfunction heap.new(expectedspace)\n\texpectedspace=expectedspace or 0\n\tlocal nt=tSize+expectedspace\n\tfor i=tSize+1,nt do\n\t\ttables[i]={false,false,false,}\n\tend\n\ttSize=nt\n\t\n\treturn{\n\t\tempty=empty,\n\t\ttop=top,\n\t\tpush=push,\n\t\tpop=pop,\n\t\tjoin=join,\n\t\tkill=kill,\n\t\t\n\t\tSize=0,\n\t\tmaxSize=expectedspace,\n    }\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=heap.new(n)\nfor i=1,n do\n    a:push(-io.read(\"n\"))\nend\n\nfor i=1,m do\n    local x=-a:top()\n    a:pop()\n    a:push(-(x//2))\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:top()\n    a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598754841, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s894641910.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894641910", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/2\n\n----------\n\n--[[\n\tPairing Min Heap\n\t\n\tBinary Heap is faster for increasing and random pushes but this is faster for joining (merging) and decreasing pushes\n\tIt is very optimized\n\t\n\tUse Kill to GC after finished using\n\t\n--]]\n\n--[[\n\tNode: {\n\tKey,\n\tLeftChild,\n\tNextSibling,\n\t}\n\t\n--]]\n\n-- Constants\n\n-- cached variables\n\n-- local variables\n\nlocal tables={}\nlocal tSize=0\n\nlocal function merge(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[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\t\t\n\t\treturn a\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\treturn b\n\tend\nend\n\nlocal function twopassmerge(a)\n\tlocal b=a and a[3]\n\tif b then\n\t\tlocal newnode=b[3]\n\t\t\n\t\ta[3]=false\n\t\tb[3]=false\n\t\t\n\t\treturn merge(merge(a,b),twopassmerge(newnode))\n\telse\n\t\treturn a\n\tend\nend\n\nlocal function empty(heap)\n\treturn not heap.root\nend\n\nlocal function top(heap)\n\treturn heap.root[1]\nend\n\nlocal function push(heap,key)\n\tlocal root=heap.Size+1\n\theap.Size=root\n\tlocal t=heap.maxSize\n\theap.maxSize=(root>t and root)or t\n\t\n\t-- inlined merge (optimized for insert)\n\troot=heap.root\n\tif not root then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\telseif root[1]<key then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[3]=root[2]\n\t\t\troot[2]=t\n\t\telse\n\t\t\troot[2]={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\troot[2],\n\t\t\t}\n\t\tend\n\telse\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[2]=root\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\troot,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\tend\nend\n\nlocal function pop(heap)\n\theap.Size=heap.Size-1\n\tlocal root=heap.root\n\theap.root=twopassmerge(root[2])\n\troot[1]=false\n\troot[2]=false\n\troot[3]=false\n\ttSize=tSize+1\n\ttables[tSize]=root\nend\n\nlocal function join(heap1,heap2)\n\t-- assumes non empty heaps\n\t-- don't kill heap2 after merging\n\t\n\tlocal a=heap1.Size+heap2.Size\n\theap1.Size=a\n\tlocal b=heap1.maxSize\n\theap1.maxSize=(a>b and a)or b\n\t\n\ta=heap1.root\n\tb=heap2.root\n\t\n\t-- inlined merge\n\tif a[1]<b[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\theap1.root=b\n\tend\n\t\n\treturn heap1\nend\n\nlocal function kill(heap)\n\tlocal nt=tSize-heap.maxSize+heap.Size\n\tfor i=nt+1,tSize do\n\t\ttables[i]=nil\n\tend\n\ttSize=nt\nend\n\nlocal heap={\n\tempty=empty,\n\ttop=top,\n\tpush=push,\n\tpop=pop,\n\tjoin=join,\n\tkill=kill,\n}\n\nfunction heap.new(expectedspace)\n\texpectedspace=expectedspace or 0\n\tlocal nt=tSize+expectedspace\n\tfor i=tSize+1,nt do\n\t\ttables[i]={false,false,false,}\n\tend\n\ttSize=nt\n\t\n\treturn{\n\t\tempty=empty,\n\t\ttop=top,\n\t\tpush=push,\n\t\tpop=pop,\n\t\tjoin=join,\n\t\tkill=kill,\n\t\t\n\t\tSize=0,\n\t\tmaxSize=expectedspace,\n    }\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=heap.new(n)\nfor i=1,n do\n    a:push(-io.read(\"n\"))\nend\n\nfor i=1,m do\n    local x=-a:top()\n    a:pop()\n    a:push(-(x//2))\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:top()\n    a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3114, "cpu_time_ms": 455, "memory_kb": 26216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s880493560", "group_id": "codeNet:p02912", "input_text": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/2\n\n----------\n\n--[[\n\tPairing Min Heap\n\t\n\tBinary Heap is faster for increasing and random pushes but this is faster for joining (merging) and decreasing pushes\n\tIt is very optimized\n\t\n\tUse Kill to GC after finished using\n\t\n--]]\n\n--[[\n\tNode: {\n\tKey,\n\tLeftChild,\n\tNextSibling,\n\t}\n\t\n--]]\n\n-- Constants\n\n-- cached variables\n\n-- local variables\n\nlocal tables={}\nlocal tSize=0\n\nlocal function merge(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[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\t\t\n\t\treturn a\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\treturn b\n\tend\nend\n\nlocal function twopassmerge(a)\n\tlocal b=a and a[3]\n\tif b then\n\t\tlocal newnode=b[3]\n\t\t\n\t\ta[3]=false\n\t\tb[3]=false\n\t\t\n\t\treturn merge(merge(a,b),twopassmerge(newnode))\n\telse\n\t\treturn a\n\tend\nend\n\nlocal function empty(heap)\n\treturn not heap.root\nend\n\nlocal function top(heap)\n\treturn heap.root[1]\nend\n\nlocal function push(heap,key)\n\tlocal root=heap.Size+1\n\theap.Size=root\n\tlocal t=heap.maxSize\n\theap.maxSize=(root>t and root)or t\n\t\n\t-- inlined merge (optimized for insert)\n\troot=heap.root\n\tif not root then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\telseif root[1]<key then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[3]=root[2]\n\t\t\troot[2]=t\n\t\telse\n\t\t\troot[2]={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\troot[2],\n\t\t\t}\n\t\tend\n\telse\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[2]=root\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\troot,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\tend\nend\n\nlocal function pop(heap)\n\theap.Size=heap.Size-1\n\tlocal root=heap.root\n\theap.root=twopassmerge(root[2])\n\troot[1]=false\n\troot[2]=false\n\troot[3]=false\n\ttSize=tSize+1\n\ttables[tSize]=root\nend\n\nlocal function join(heap1,heap2)\n\t-- assumes non empty heaps\n\t-- don't kill heap2 after merging\n\t\n\tlocal a=heap1.Size+heap2.Size\n\theap1.Size=a\n\tlocal b=heap1.maxSize\n\theap1.maxSize=(a>b and a)or b\n\t\n\ta=heap1.root\n\tb=heap2.root\n\t\n\t-- inlined merge\n\tif a[1]<b[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\theap1.root=b\n\tend\n\t\n\treturn heap1\nend\n\nlocal function kill(heap)\n\tlocal nt=tSize-heap.maxSize+heap.Size\n\tfor i=nt+1,tSize do\n\t\ttables[i]=nil\n\tend\n\ttSize=nt\nend\n\nlocal heap={\n\tempty=empty,\n\ttop=top,\n\tpush=push,\n\tpop=pop,\n\tjoin=join,\n\tkill=kill,\n}\n\nfunction heap.new(expectedspace)\n\texpectedspace=expectedspace or 0\n\tlocal nt=tSize+expectedspace\n\tfor i=tSize+1,nt do\n\t\ttables[i]={false,false,false,}\n\tend\n\ttSize=nt\n\t\n\treturn{\n\t\tempty=empty,\n\t\ttop=top,\n\t\tpush=push,\n\t\tpop=pop,\n\t\tjoin=join,\n\t\tkill=kill,\n\t\t\n\t\tSize=0,\n\t\tmaxSize=expectedspace,\n    }\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=heap.new(n)\nfor i=1,n do\n    a:push(io.read(\"n\"))\nend\n\nfor i=1,m do\n    local x=a:top()\n    a:pop()\n    a:push(x//2)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598754520, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s880493560.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s880493560", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/2\n\n----------\n\n--[[\n\tPairing Min Heap\n\t\n\tBinary Heap is faster for increasing and random pushes but this is faster for joining (merging) and decreasing pushes\n\tIt is very optimized\n\t\n\tUse Kill to GC after finished using\n\t\n--]]\n\n--[[\n\tNode: {\n\tKey,\n\tLeftChild,\n\tNextSibling,\n\t}\n\t\n--]]\n\n-- Constants\n\n-- cached variables\n\n-- local variables\n\nlocal tables={}\nlocal tSize=0\n\nlocal function merge(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[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\t\t\n\t\treturn a\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\treturn b\n\tend\nend\n\nlocal function twopassmerge(a)\n\tlocal b=a and a[3]\n\tif b then\n\t\tlocal newnode=b[3]\n\t\t\n\t\ta[3]=false\n\t\tb[3]=false\n\t\t\n\t\treturn merge(merge(a,b),twopassmerge(newnode))\n\telse\n\t\treturn a\n\tend\nend\n\nlocal function empty(heap)\n\treturn not heap.root\nend\n\nlocal function top(heap)\n\treturn heap.root[1]\nend\n\nlocal function push(heap,key)\n\tlocal root=heap.Size+1\n\theap.Size=root\n\tlocal t=heap.maxSize\n\theap.maxSize=(root>t and root)or t\n\t\n\t-- inlined merge (optimized for insert)\n\troot=heap.root\n\tif not root then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\telseif root[1]<key then\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[3]=root[2]\n\t\t\troot[2]=t\n\t\telse\n\t\t\troot[2]={\n\t\t\t\tkey,\n\t\t\t\tfalse,\n\t\t\t\troot[2],\n\t\t\t}\n\t\tend\n\telse\n\t\tif tSize>0 then\n\t\t\tt=tables[tSize]\n\t\t\ttables[tSize]=nil\n\t\t\ttSize=tSize-1\n\t\t\tt[1]=key\n\t\t\tt[2]=root\n\t\t\theap.root=t\n\t\telse\n\t\t\theap.root={\n\t\t\t\tkey,\n\t\t\t\troot,\n\t\t\t\tfalse,\n\t\t\t}\n\t\tend\n\tend\nend\n\nlocal function pop(heap)\n\theap.Size=heap.Size-1\n\tlocal root=heap.root\n\theap.root=twopassmerge(root[2])\n\troot[1]=false\n\troot[2]=false\n\troot[3]=false\n\ttSize=tSize+1\n\ttables[tSize]=root\nend\n\nlocal function join(heap1,heap2)\n\t-- assumes non empty heaps\n\t-- don't kill heap2 after merging\n\t\n\tlocal a=heap1.Size+heap2.Size\n\theap1.Size=a\n\tlocal b=heap1.maxSize\n\theap1.maxSize=(a>b and a)or b\n\t\n\ta=heap1.root\n\tb=heap2.root\n\t\n\t-- inlined merge\n\tif a[1]<b[1]then\n\t\t-- inlined add child\n\t\tb[3]=a[2]\n\t\ta[2]=b\n\telse\n\t\t-- inlined add child\n\t\ta[3]=b[2]\n\t\tb[2]=a\n\t\t\n\t\theap1.root=b\n\tend\n\t\n\treturn heap1\nend\n\nlocal function kill(heap)\n\tlocal nt=tSize-heap.maxSize+heap.Size\n\tfor i=nt+1,tSize do\n\t\ttables[i]=nil\n\tend\n\ttSize=nt\nend\n\nlocal heap={\n\tempty=empty,\n\ttop=top,\n\tpush=push,\n\tpop=pop,\n\tjoin=join,\n\tkill=kill,\n}\n\nfunction heap.new(expectedspace)\n\texpectedspace=expectedspace or 0\n\tlocal nt=tSize+expectedspace\n\tfor i=tSize+1,nt do\n\t\ttables[i]={false,false,false,}\n\tend\n\ttSize=nt\n\t\n\treturn{\n\t\tempty=empty,\n\t\ttop=top,\n\t\tpush=push,\n\t\tpop=pop,\n\t\tjoin=join,\n\t\tkill=kill,\n\t\t\n\t\tSize=0,\n\t\tmaxSize=expectedspace,\n    }\nend\n\n----------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=heap.new(n)\nfor i=1,n do\n    a:push(io.read(\"n\"))\nend\n\nfor i=1,m do\n    local x=a:top()\n    a:pop()\n    a:push(x//2)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:top()\n    a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3109, "cpu_time_ms": 400, "memory_kb": 26280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s151386995", "group_id": "codeNet:p02912", "input_text": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/5\n\n--[[\n\tvEB (van Emde Boas Trees)\n\t\n\tThis is slow because it recurses and calls functions. Because of this, it is recommended to use a Red-Black Binary Search Tree instead.\n\t\n    u defines the desired upper bound, each node has u^0.5 children.\n    You want u to be as close as possible to the maximum Value.\n\n    You can insert negative numbers as well but it is a bit inefficient so it is better to offset all of the numbers by a constant beforehand.\n\t\n\tSources:\n\t\thttps://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-notes/MIT6_046JS15_lec04.pdf\n\t\thttps://www.youtube.com/watch?v=hmReJCupbNU\n\t\thttps://github.com/erikwaing/VEBTree\n\t\t\n\tComplexity:\n\t\tMin: O(1)\n\t\tMax: O(1)\n\t\tMember: O(lglg(u))\n\t\tUpper Bound: O(lglg(u))\n\t\tLower Bound: O(lglg(u))\n\t\tInsertion: O(lglg(u))\n\t\tDeletion: O(lglg(u))\n\n\tExample Usage:\n\t\tlocal v = require(this).New(15)\n\n\t\tv:Insert(1)\n\t\tv:Insert(3)\n\t\tv:Insert(4)\n\t\tv:Insert(5)\n\t\tv:Insert(7)\n\t\tv:Insert(8)\n\t\tv:Insert(10)\n\t\tv:Insert(0)\n\t\tv:Insert(12)\n\t\tv:Insert(14)\n\t\t\n\t\tprint(v:UpperBound(13))\n\t\t\n\t\t-- iterating\n\t\tlocal i = v.Min\n\t\twhile i do\n\t\t\tprint(i)\n\t\t\ti = v:Successor(i)\n\t\tend\n\t\n--]]\n\n-- Constants\n\n-- efficiency variables\nlocal error=error\nlocal floor=math.floor\n\n-- local variables\n\nlocal function newveb(u)\n\tlocal self={\n\t\tu,-- u\n\t\tfalse,-- min\n\t\tfalse,-- max\n\t\tfalse,\n\t\tfalse,\n\t\tfloor(u^.5),\n\t}\n\t\n\tif u>2 then\n\t\tlocal clusters={}\n\t\tfor i=1,self[6]+1 do\n\t\t\tclusters[i]=false\n\t\tend\n\t\t\n\t\tself[4]=clusters-- clusters\n\t\t--self[5] = nil -- summary\n\tend\n\t\n\treturn self\nend\n\nlocal function high(self,x)\n\treturn floor(x/self[6])+1\nend\n\nlocal function low(self,x)\n\treturn x%self[6]+1\nend\n\nlocal function index(self,h,l)\n\treturn(h-1)*self[6]+l-1\nend\n\nlocal function member(self,x)\n\t-- returns whether x is a member of the vEB\n\tif x==self[2]or x==self[3]then\n\t\t-- found x as the min or max\n\t\treturn true\n\telseif self[1]<=2 then\n\t\t-- has not found x in the \"leaf\"\n\t\treturn\n\telse\n\t\tlocal cluster=self[4][high(self,x)]\n\t\tif cluster then\n\t\t\t-- look for x in the cluster\n\t\t\treturn member(cluster,low(self,x))\n\t\tend\n\tend\nend\n\nlocal function successor(self,x)\n\tlocal m=self[2]\n\tif self[1]<=2 then\n\t\tif x==0 and self[3]==1 then\n\t\t\treturn 1\n\t\tend\n\telseif m and x<m then\n\t\t-- x is less than everything in the tree, return the minimum\n\t\treturn m\n\telse\n\t\tlocal h=high(self,x)\n\t\tlocal l=low(self,x)\n\t\tm=self[4]\n\t\tlocal cluster=m[h]\n\t\tlocal n=cluster and cluster[3]\n\t\t\n\t\tif n and l<n then\n\t\t\treturn index(self,h,successor(cluster,l))\n\t\telse\n\t\t\tn=self[5]\n\t\t\tif n then\n\t\t\t\tn=successor(n,h)\n\t\t\t\tif n then\n\t\t\t\t\tlocal cluster2=m[n]\n\t\t\t\t\tif cluster2 then\n\t\t\t\t\t\treturn index(self,n,cluster2[2])\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\tend\nend\n\nlocal function predecessor(self,x)\n\tlocal n=self[2]\n\tlocal m=self[3]\n\tif self[1]<=2 then\n\t\tif x==1 and n==0 then\n\t\t\treturn 0\n\t\tend\n\telseif m and x>m then\n\t\treturn m\n\telse\n\t\tlocal h=high(self,x)\n\t\tlocal l=low(self,x)\n\t\tm=self[4]\n\t\tlocal cluster=m[h]\n\t\tlocal minlow=cluster and cluster[2]\n\t\t\n\t\tif minlow and l>minlow then\n\t\t\treturn index(self,h,predecessor(cluster,l)or 0)\n\t\telse\n\t\t\tlocal predcluster=self[5]\n\t\t\tif predcluster then\n\t\t\t\tpredcluster=predecessor(predcluster,h)\n\t\t\tend\n\t\t\tif predcluster then\n\t\t\t\tm=m[predcluster]\n\t\t\t\treturn index(self,predcluster,(m and m[3])or 0)\n\t\t\telseif n and x>n then\n\t\t\t\treturn n\n\t\t\tend\n\t\tend\n\tend\nend\n\nlocal function insert(self,x)\n\tlocal m=self[2]\n\tif m then\n\t\tif x<m then\n\t\t\t-- swap x and min if x is less than min to *actually* insert min instead of x\n\t\t\tself[2]=x\n\t\t\tx=m\n\t\tend\n\t\t\n\t\tm=self[1]\n\t\tif m>2 then\n\t\t\tm=high(self,m)\n\t\t\tlocal h=high(self,x)\n\t\t\tlocal cluster=self[4][h]\n\t\t\tlocal summary=self[5]\n\t\t\t\n\t\t\tif not cluster then\n\t\t\t\t-- if the cluster doesn't exist then create it (save space by not having it exist) and set its bound to sqrt of u\n\t\t\t\tcluster=newveb(m)\n\t\t\t\tself[4][h]=cluster\n\t\t\tend\n\t\t\tif not summary then\n\t\t\t\tsummary=newveb(m)\n\t\t\t\tself[5]=summary\n\t\t\tend\n\t\t\tif cluster[2]then\n\t\t\t\tinsert(cluster,low(self,x))\n\t\t\telse\n\t\t\t\tinsert(summary,h)\n\t\t\t\tlocal x=low(self,x)\n\t\t\t\tcluster[2]=x\n\t\t\t\tcluster[3]=x\n\t\t\tend\n\t\tend\n\t\tif x>self[3]then\n\t\t\tself[3]=x\n\t\tend\n\telse\n\t\tself[2]=x\n\t\tself[3]=x\n\tend\nend\n\nlocal function delete(self,x)\n\tlocal h\n\tlocal m=self[4]\n\tlocal p=self[5]\n\t\n\tif x==self[2]then\n\t\th=p\n\t\th=h and h[2]\n\t\tif not h then\n\t\t\tself[2]=nil\n\t\t\tself[3]=nil\n\t\t\treturn\n\t\tend\n\t\t\n\t\tx=index(self,h,m[h][2])\n\t\tself[2]=x\n\tend\n\t\n\tlocal o=high(self,x)\n\tlocal n=m[o]\n\tdelete(n,low(self,x))\n\tif not n[2]then\n\t\tdelete(p,o)\n\t\tm[o]=false--nil -- delete it if its not being used\n\tend\n\tif x==self[3]then\n\t\tlocal h=p[3]\n\t\tself[3]=h and index(self,h,m[h][3])or self[2]\n\tend\nend\n\nlocal function vinsert(self,x)\n\tinsert(self,x)\n\tself.min=self[2]\n\tself.max=self[3]\n\tself.Size=self.Size+1\n\t\n\treturn self\nend\n\nlocal function vdelete(self,x)\n\tdelete(self,x)\n\tself.min=self[2]\n\tself.max=self[3]\n\tself.Size=self.Size-1\n\t\n\treturn self\nend\n\nlocal function vupperbound(self,x)\n\treturn predecessor(self,x+1)\nend\n\nlocal function vlowerbound(self,x)\n\treturn successor(self,x-1)\nend\n\nlocal function vclear(self)\n\tself[2]=false\n\tself[3]=false\n\tlocal a=self[4]\n\tif a then\n\t\tfor i=1,#a do\n\t\t\ta[i]=false\n\t\tend\n\tend\n\tself[5]=false\n\t\n\treturn self\nend\n\nlocal function vempty(self)\n\treturn not self[1]\nend\n\nlocal veb={\n\tinsert=vinsert,\n\tdelete=vdelete,\n\tmember=member,\n\tupperbound=vupperbound,\n\tlowerbound=vlowerbound,\n\tsuccessor=successor,\n\tpredecessor=predecessor,\n\tclear=vclear,\n\tempty=vempty,\n}\n\nfunction veb.new(u)\n\tif u<0 then\n\t\terror('Upper bound cannot be less than 0',2)\n\tend\n\t\n\tlocal self=newveb(u)\n\t\n\tself.Size=0\n\tself.max=false\n\tself.min=false\n\tself.u=u\n\t\n\tself.insert=vinsert\n\tself.delete=vdelete\n\tself.member=member\n\tself.upperbound=vupperbound\n\tself.lowerbound=vlowerbound\n\tself.clear=vclear\n\tself.empty=vempty\n\tself.successor=successor\n\tself.predecessor=predecessor\n\t\n\treturn self\nend\n\n---------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=veb.new(n)\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:insert(input)\nend\n\nfor i=1,m do\n    x=a.max\n    a:delete(x)\n    x=x//2\n    a:insert(x)\nend\n\nlocal total=0\nfor i=1,n do\n    local x=a.max\n    a:delete(x)\n    total=total+x\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1598732706, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s151386995.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s151386995", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "--url : https://devforum.roblox.com/t/commonly-used-tree-data-structures-in-lua/265673/5\n\n--[[\n\tvEB (van Emde Boas Trees)\n\t\n\tThis is slow because it recurses and calls functions. Because of this, it is recommended to use a Red-Black Binary Search Tree instead.\n\t\n    u defines the desired upper bound, each node has u^0.5 children.\n    You want u to be as close as possible to the maximum Value.\n\n    You can insert negative numbers as well but it is a bit inefficient so it is better to offset all of the numbers by a constant beforehand.\n\t\n\tSources:\n\t\thttps://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-notes/MIT6_046JS15_lec04.pdf\n\t\thttps://www.youtube.com/watch?v=hmReJCupbNU\n\t\thttps://github.com/erikwaing/VEBTree\n\t\t\n\tComplexity:\n\t\tMin: O(1)\n\t\tMax: O(1)\n\t\tMember: O(lglg(u))\n\t\tUpper Bound: O(lglg(u))\n\t\tLower Bound: O(lglg(u))\n\t\tInsertion: O(lglg(u))\n\t\tDeletion: O(lglg(u))\n\n\tExample Usage:\n\t\tlocal v = require(this).New(15)\n\n\t\tv:Insert(1)\n\t\tv:Insert(3)\n\t\tv:Insert(4)\n\t\tv:Insert(5)\n\t\tv:Insert(7)\n\t\tv:Insert(8)\n\t\tv:Insert(10)\n\t\tv:Insert(0)\n\t\tv:Insert(12)\n\t\tv:Insert(14)\n\t\t\n\t\tprint(v:UpperBound(13))\n\t\t\n\t\t-- iterating\n\t\tlocal i = v.Min\n\t\twhile i do\n\t\t\tprint(i)\n\t\t\ti = v:Successor(i)\n\t\tend\n\t\n--]]\n\n-- Constants\n\n-- efficiency variables\nlocal error=error\nlocal floor=math.floor\n\n-- local variables\n\nlocal function newveb(u)\n\tlocal self={\n\t\tu,-- u\n\t\tfalse,-- min\n\t\tfalse,-- max\n\t\tfalse,\n\t\tfalse,\n\t\tfloor(u^.5),\n\t}\n\t\n\tif u>2 then\n\t\tlocal clusters={}\n\t\tfor i=1,self[6]+1 do\n\t\t\tclusters[i]=false\n\t\tend\n\t\t\n\t\tself[4]=clusters-- clusters\n\t\t--self[5] = nil -- summary\n\tend\n\t\n\treturn self\nend\n\nlocal function high(self,x)\n\treturn floor(x/self[6])+1\nend\n\nlocal function low(self,x)\n\treturn x%self[6]+1\nend\n\nlocal function index(self,h,l)\n\treturn(h-1)*self[6]+l-1\nend\n\nlocal function member(self,x)\n\t-- returns whether x is a member of the vEB\n\tif x==self[2]or x==self[3]then\n\t\t-- found x as the min or max\n\t\treturn true\n\telseif self[1]<=2 then\n\t\t-- has not found x in the \"leaf\"\n\t\treturn\n\telse\n\t\tlocal cluster=self[4][high(self,x)]\n\t\tif cluster then\n\t\t\t-- look for x in the cluster\n\t\t\treturn member(cluster,low(self,x))\n\t\tend\n\tend\nend\n\nlocal function successor(self,x)\n\tlocal m=self[2]\n\tif self[1]<=2 then\n\t\tif x==0 and self[3]==1 then\n\t\t\treturn 1\n\t\tend\n\telseif m and x<m then\n\t\t-- x is less than everything in the tree, return the minimum\n\t\treturn m\n\telse\n\t\tlocal h=high(self,x)\n\t\tlocal l=low(self,x)\n\t\tm=self[4]\n\t\tlocal cluster=m[h]\n\t\tlocal n=cluster and cluster[3]\n\t\t\n\t\tif n and l<n then\n\t\t\treturn index(self,h,successor(cluster,l))\n\t\telse\n\t\t\tn=self[5]\n\t\t\tif n then\n\t\t\t\tn=successor(n,h)\n\t\t\t\tif n then\n\t\t\t\t\tlocal cluster2=m[n]\n\t\t\t\t\tif cluster2 then\n\t\t\t\t\t\treturn index(self,n,cluster2[2])\n\t\t\t\t\tend\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\tend\nend\n\nlocal function predecessor(self,x)\n\tlocal n=self[2]\n\tlocal m=self[3]\n\tif self[1]<=2 then\n\t\tif x==1 and n==0 then\n\t\t\treturn 0\n\t\tend\n\telseif m and x>m then\n\t\treturn m\n\telse\n\t\tlocal h=high(self,x)\n\t\tlocal l=low(self,x)\n\t\tm=self[4]\n\t\tlocal cluster=m[h]\n\t\tlocal minlow=cluster and cluster[2]\n\t\t\n\t\tif minlow and l>minlow then\n\t\t\treturn index(self,h,predecessor(cluster,l)or 0)\n\t\telse\n\t\t\tlocal predcluster=self[5]\n\t\t\tif predcluster then\n\t\t\t\tpredcluster=predecessor(predcluster,h)\n\t\t\tend\n\t\t\tif predcluster then\n\t\t\t\tm=m[predcluster]\n\t\t\t\treturn index(self,predcluster,(m and m[3])or 0)\n\t\t\telseif n and x>n then\n\t\t\t\treturn n\n\t\t\tend\n\t\tend\n\tend\nend\n\nlocal function insert(self,x)\n\tlocal m=self[2]\n\tif m then\n\t\tif x<m then\n\t\t\t-- swap x and min if x is less than min to *actually* insert min instead of x\n\t\t\tself[2]=x\n\t\t\tx=m\n\t\tend\n\t\t\n\t\tm=self[1]\n\t\tif m>2 then\n\t\t\tm=high(self,m)\n\t\t\tlocal h=high(self,x)\n\t\t\tlocal cluster=self[4][h]\n\t\t\tlocal summary=self[5]\n\t\t\t\n\t\t\tif not cluster then\n\t\t\t\t-- if the cluster doesn't exist then create it (save space by not having it exist) and set its bound to sqrt of u\n\t\t\t\tcluster=newveb(m)\n\t\t\t\tself[4][h]=cluster\n\t\t\tend\n\t\t\tif not summary then\n\t\t\t\tsummary=newveb(m)\n\t\t\t\tself[5]=summary\n\t\t\tend\n\t\t\tif cluster[2]then\n\t\t\t\tinsert(cluster,low(self,x))\n\t\t\telse\n\t\t\t\tinsert(summary,h)\n\t\t\t\tlocal x=low(self,x)\n\t\t\t\tcluster[2]=x\n\t\t\t\tcluster[3]=x\n\t\t\tend\n\t\tend\n\t\tif x>self[3]then\n\t\t\tself[3]=x\n\t\tend\n\telse\n\t\tself[2]=x\n\t\tself[3]=x\n\tend\nend\n\nlocal function delete(self,x)\n\tlocal h\n\tlocal m=self[4]\n\tlocal p=self[5]\n\t\n\tif x==self[2]then\n\t\th=p\n\t\th=h and h[2]\n\t\tif not h then\n\t\t\tself[2]=nil\n\t\t\tself[3]=nil\n\t\t\treturn\n\t\tend\n\t\t\n\t\tx=index(self,h,m[h][2])\n\t\tself[2]=x\n\tend\n\t\n\tlocal o=high(self,x)\n\tlocal n=m[o]\n\tdelete(n,low(self,x))\n\tif not n[2]then\n\t\tdelete(p,o)\n\t\tm[o]=false--nil -- delete it if its not being used\n\tend\n\tif x==self[3]then\n\t\tlocal h=p[3]\n\t\tself[3]=h and index(self,h,m[h][3])or self[2]\n\tend\nend\n\nlocal function vinsert(self,x)\n\tinsert(self,x)\n\tself.min=self[2]\n\tself.max=self[3]\n\tself.Size=self.Size+1\n\t\n\treturn self\nend\n\nlocal function vdelete(self,x)\n\tdelete(self,x)\n\tself.min=self[2]\n\tself.max=self[3]\n\tself.Size=self.Size-1\n\t\n\treturn self\nend\n\nlocal function vupperbound(self,x)\n\treturn predecessor(self,x+1)\nend\n\nlocal function vlowerbound(self,x)\n\treturn successor(self,x-1)\nend\n\nlocal function vclear(self)\n\tself[2]=false\n\tself[3]=false\n\tlocal a=self[4]\n\tif a then\n\t\tfor i=1,#a do\n\t\t\ta[i]=false\n\t\tend\n\tend\n\tself[5]=false\n\t\n\treturn self\nend\n\nlocal function vempty(self)\n\treturn not self[1]\nend\n\nlocal veb={\n\tinsert=vinsert,\n\tdelete=vdelete,\n\tmember=member,\n\tupperbound=vupperbound,\n\tlowerbound=vlowerbound,\n\tsuccessor=successor,\n\tpredecessor=predecessor,\n\tclear=vclear,\n\tempty=vempty,\n}\n\nfunction veb.new(u)\n\tif u<0 then\n\t\terror('Upper bound cannot be less than 0',2)\n\tend\n\t\n\tlocal self=newveb(u)\n\t\n\tself.Size=0\n\tself.max=false\n\tself.min=false\n\tself.u=u\n\t\n\tself.insert=vinsert\n\tself.delete=vdelete\n\tself.member=member\n\tself.upperbound=vupperbound\n\tself.lowerbound=vlowerbound\n\tself.clear=vclear\n\tself.empty=vempty\n\tself.successor=successor\n\tself.predecessor=predecessor\n\t\n\treturn self\nend\n\n---------\n\nlocal n,m=io.read(\"n\",\"n\")\nlocal a=veb.new(n)\nfor i=1,n do\n    local input=io.read(\"n\")\n    a:insert(input)\nend\n\nfor i=1,m do\n    x=a.max\n    a:delete(x)\n    x=x//2\n    a:insert(x)\nend\n\nlocal total=0\nfor i=1,n do\n    local x=a.max\n    a:delete(x)\n    total=total+x\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6201, "cpu_time_ms": 2215, "memory_kb": 348256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s141316734", "group_id": "codeNet:p02912", "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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1591153020, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s141316734.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141316734", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3560, "cpu_time_ms": 228, "memory_kb": 13824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s895415694", "group_id": "codeNet:p02912", "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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:pop()\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1591152994, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s895415694.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s895415694", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total-a:pop()\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3557, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s327294813", "group_id": "codeNet:p02912", "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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "language": "Lua", "metadata": {"date": 1591152839, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s327294813.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s327294813", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3561, "cpu_time_ms": 225, "memory_kb": 13824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s093360955", "group_id": "codeNet:p02912", "input_text": "--[[問題文\n高橋くんは N個の品物を 1個ずつ順番に買う予定です。i番目に買う品物の値段は Ai円です。高橋くんは M枚の割引券を持っています。品物を買う際に割引券を好きな枚数使うことができます。X円の品物を買う際に Y 枚の割引券を使った場合、その品物を X/2^Y円(小数点以下切り捨て)で買うことができます。最小で何円あれば全ての品物を買うことができるでしょうか。\n\n制約\n入力は全て整数である。\n1≤N,M≤10^5, 1≤Ai≤10^9]]\n\n--M枚の商品券をいかに効率良く振り分けるか。つまり商品券1枚あたりの割引価格をどれだけ大きくできるか。\n--当然のことだけど全部使い切ったほうがいい。\n--最初の1枚は、自明に1番値段の高いものに使うべき。\n--次は、1枚割引券を使った状態でもっとも高いものに使うべき。\n--以下M枚使い切るまで行う。\n--素直に実装するなら、一番大きな要素を割るたびにソートを行ってループするという感じ。\n--これを以前c++で実装したけどtleになった。ソートの計算量いくらなんだろうね。\n--一応同じような実装で出してみる。tlew\n\n--[[\nn,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nfor i=1,m do\n    table.sort(a)\n    a[n]=a[n]//2\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)\n]]\n\n--2分探索使えないかな。\n--1番大きいのを割ったらa[i]<=a[n]<=a[j]となる位置に移動させる\n--うーん。移動ってのはどう実装したらいいだろう。結局ソートと変わらないってことにはならないかな\n--一番大きいのを割っていく過程で、キーを記録しておいて、割ったあとに最大だった項とその次に大きな項で比較して、大小関係に応じてキーの記録を更新するというやりかたをさっきやったけどそれだと最大値でなくなった項が再び最大値になるパターンを取りこぼすから、記録の仕方を工夫しないといけない。\n--キーじゃなくて値を配列に保存して、配列の最大値と比較するってのはどうだろう。\n--実装がややこしくなりそうだし計算量も改善できるだろうか。。。\n--あっ、無理かも。格納される項の最大値M=10^5だから計算量はM(M-1)/2に比例するはず。\n--実装してみよう。\n\n--[[\nn,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\ntable.sort(a)\nif n==1 then\n    return print(string.format(\"%d\",a[1]//(2^m)))\nend\n\nt={}\nkey=n\nfor i=1,m do\n    a[key]=a[key]//2\n    table.insert(t,{a[key],key})\n    if #t>1 then\n        table.sort(t,function(a,b)\n            return a[1]<b[1]\n        end)\n    end\n    if t[#t][1]<=a[key] then\n        key=t[#t][2]\n    else\n        if key-1==0 then\n            break\n        else\n            key=key-1\n        end\n    end\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)\n]]\n\n--TLEかつWAだった。テーブルをキーの取得にしか使ってなかったせいだと思う。値を消さないと。\n\n--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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "language": "Lua", "metadata": {"date": 1591152755, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s093360955.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s093360955", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "--[[問題文\n高橋くんは N個の品物を 1個ずつ順番に買う予定です。i番目に買う品物の値段は Ai円です。高橋くんは M枚の割引券を持っています。品物を買う際に割引券を好きな枚数使うことができます。X円の品物を買う際に Y 枚の割引券を使った場合、その品物を X/2^Y円(小数点以下切り捨て)で買うことができます。最小で何円あれば全ての品物を買うことができるでしょうか。\n\n制約\n入力は全て整数である。\n1≤N,M≤10^5, 1≤Ai≤10^9]]\n\n--M枚の商品券をいかに効率良く振り分けるか。つまり商品券1枚あたりの割引価格をどれだけ大きくできるか。\n--当然のことだけど全部使い切ったほうがいい。\n--最初の1枚は、自明に1番値段の高いものに使うべき。\n--次は、1枚割引券を使った状態でもっとも高いものに使うべき。\n--以下M枚使い切るまで行う。\n--素直に実装するなら、一番大きな要素を割るたびにソートを行ってループするという感じ。\n--これを以前c++で実装したけどtleになった。ソートの計算量いくらなんだろうね。\n--一応同じような実装で出してみる。tlew\n\n--[[\nn,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nfor i=1,m do\n    table.sort(a)\n    a[n]=a[n]//2\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)\n]]\n\n--2分探索使えないかな。\n--1番大きいのを割ったらa[i]<=a[n]<=a[j]となる位置に移動させる\n--うーん。移動ってのはどう実装したらいいだろう。結局ソートと変わらないってことにはならないかな\n--一番大きいのを割っていく過程で、キーを記録しておいて、割ったあとに最大だった項とその次に大きな項で比較して、大小関係に応じてキーの記録を更新するというやりかたをさっきやったけどそれだと最大値でなくなった項が再び最大値になるパターンを取りこぼすから、記録の仕方を工夫しないといけない。\n--キーじゃなくて値を配列に保存して、配列の最大値と比較するってのはどうだろう。\n--実装がややこしくなりそうだし計算量も改善できるだろうか。。。\n--あっ、無理かも。格納される項の最大値M=10^5だから計算量はM(M-1)/2に比例するはず。\n--実装してみよう。\n\n--[[\nn,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\ntable.sort(a)\nif n==1 then\n    return print(string.format(\"%d\",a[1]//(2^m)))\nend\n\nt={}\nkey=n\nfor i=1,m do\n    a[key]=a[key]//2\n    table.insert(t,{a[key],key})\n    if #t>1 then\n        table.sort(t,function(a,b)\n            return a[1]<b[1]\n        end)\n    end\n    if t[#t][1]<=a[key] then\n        key=t[#t][2]\n    else\n        if key-1==0 then\n            break\n        else\n            key=key-1\n        end\n    end\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)\n]]\n\n--TLEかつWAだった。テーブルをキーの取得にしか使ってなかったせいだと思う。値を消さないと。\n\n--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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=floor(x/2)\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6781, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s392032661", "group_id": "codeNet:p02912", "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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=x//2\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "language": "Lua", "metadata": {"date": 1591152653, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s392032661.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s392032661", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\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 <lucas.morais.siqueira@gmail.com>\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\nfor i=1,m do\n    x=a:pop()\n    x=-x\n    x=x//2\n    a:put(-x,-x)\nend\n\nlocal total=0\nfor i=1,n do\n    total=total+a:pop()\nend\nprint(-total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3552, "cpu_time_ms": 2108, "memory_kb": 24184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s277469041", "group_id": "codeNet:p02912", "input_text": "n,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\ntable.sort(a)\nif n==1 then\n    return print(string.format(\"%d\",a[1]//(2^m)))\nend\n\nt={}\nkey=n\nfor i=1,m do\n    a[key]=a[key]//2\n    table.insert(t,{a[key],key})\n    if #t>1 then\n        table.sort(t,function(a,b)\n            return a[1]<b[1]\n        end)\n    end\n    if t[#t][1]<=a[key] then\n        key=t[#t][2]\n    else\n        if key-1==0 then\n            break\n        else\n            key=key-1\n        end\n    end\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1588715737, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s277469041.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277469041", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\ntable.sort(a)\nif n==1 then\n    return print(string.format(\"%d\",a[1]//(2^m)))\nend\n\nt={}\nkey=n\nfor i=1,m do\n    a[key]=a[key]//2\n    table.insert(t,{a[key],key})\n    if #t>1 then\n        table.sort(t,function(a,b)\n            return a[1]<b[1]\n        end)\n    end\n    if t[#t][1]<=a[key] then\n        key=t[#t][2]\n    else\n        if key-1==0 then\n            break\n        else\n            key=key-1\n        end\n    end\nend\n\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s827546410", "group_id": "codeNet:p02912", "input_text": "n,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nfor i=1,m do\n    table.sort(a)\n    a[n]=a[n]//2\nend\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1588712479, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s827546410.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s827546410", "user_id": "u045238009"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "n,m=io.read(\"*n\",\"*n\",\"*l\")\na={}\nfor i=1,n do\n    a[i]=io.read(\"*n\")\nend\n\nfor i=1,m do\n    table.sort(a)\n    a[n]=a[n]//2\nend\ntotal=0\nfor i=1,n do\n    total=total+a[i]\nend\nprint(total)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s357831359", "group_id": "codeNet:p02912", "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\"\nM=io.read\"*n\"\nA=reada(N)\n\nfor j=1,M do\n\tmaxv=A[1]\n\tmaxi=1\n\tfor i=2,N do\n\t\tif(maxv<A[i])then\n\t\t\tmaxv=A[i]\n\t\t\tmaxi=i\n\t\tend\n\tend\n\tA[maxi]=A[maxi]*.5\nend\n\ns=0\nfor i=1,N do s=s+math.floor(A[i])end\nprint(s)", "language": "Lua", "metadata": {"date": 1588255471, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s357831359.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s357831359", "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\"\nM=io.read\"*n\"\nA=reada(N)\n\nfor j=1,M do\n\tmaxv=A[1]\n\tmaxi=1\n\tfor i=2,N do\n\t\tif(maxv<A[i])then\n\t\t\tmaxv=A[i]\n\t\t\tmaxi=i\n\t\tend\n\tend\n\tA[maxi]=A[maxi]*.5\nend\n\ns=0\nfor i=1,N do s=s+math.floor(A[i])end\nprint(s)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 2103, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s423453269", "group_id": "codeNet:p02912", "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]\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  self.stage[stagenum][1] = false\n  for i = 2, 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.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\nSegAvlTree.create = function(self, lessthan, n)\n  self.lessthan = lessthan\n  self.root = 1\n  self.seg = SegForAvl.new(n + 1)\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\nSegAvlTree.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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 1 < 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  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\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  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\n  self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nSegAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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 1 < self.l[node] do\n    node = self.l[node]\n  end\n  local v = self.v[node]\n  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal avl = SegAvlTree.new(function(a, b) return a < b end, n)\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  avl:add(-a)\nend\nfor i = 1, m do\n  local v = avl:pop()\n  avl:add(-mfl(-v / 2))\nend\nlocal ret = 0\n\nlocal tasks = {avl.root}\nlocal done = 0\nwhile done < #tasks do\n  done = done + 1\n  local node = tasks[done]\n  ret = ret - avl.v[node]\n  if 1 < avl.l[node] then table.insert(tasks, avl.l[node]) end\n  if 1 < avl.r[node] then table.insert(tasks, avl.r[node]) end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568681204, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s423453269.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423453269", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\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]\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  self.stage[stagenum][1] = false\n  for i = 2, 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.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\nSegAvlTree.create = function(self, lessthan, n)\n  self.lessthan = lessthan\n  self.root = 1\n  self.seg = SegForAvl.new(n + 1)\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\nSegAvlTree.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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 1 < 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  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\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  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\n  self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nSegAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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 1 < self.l[node] do\n    node = self.l[node]\n  end\n  local v = self.v[node]\n  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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\nlocal n, m = io.read(\"*n\", \"*n\")\nlocal avl = SegAvlTree.new(function(a, b) return a < b end, n)\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  avl:add(-a)\nend\nfor i = 1, m do\n  local v = avl:pop()\n  avl:add(-mfl(-v / 2))\nend\nlocal ret = 0\n\nlocal tasks = {avl.root}\nlocal done = 0\nwhile done < #tasks do\n  done = done + 1\n  local node = tasks[done]\n  ret = ret - avl.v[node]\n  if 1 < avl.l[node] then table.insert(tasks, avl.l[node]) end\n  if 1 < avl.r[node] then table.insert(tasks, avl.r[node]) end\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6775, "cpu_time_ms": 476, "memory_kb": 10228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361937859", "group_id": "codeNet:p02912", "input_text": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568647691, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s361937859.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s361937859", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2133, "cpu_time_ms": 582, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s190027310", "group_id": "codeNet:p02912", "input_text": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    self.a = a\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nlocal a = q.a\nfor i=1,N do\n    sum = sum + floor(a[i])\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568647556, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s190027310.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s190027310", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    self.a = a\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nlocal a = q.a\nfor i=1,N do\n    sum = sum + floor(a[i])\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2134, "cpu_time_ms": 2103, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s729526749", "group_id": "codeNet:p02912", "input_text": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568647328, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s729526749.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s729526749", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local floor = math.floor\n-- heap\nlocal function Heap(upper_func)\n    local floor = math.floor\n    local a = {}\n    local upper = function(k1, k2)\n        --assert(k1 < k2)\n        if k1 == 0 then\n            return false\n        else\n            return upper_func(a[k1], a[k2])\n        end\n    end\n\n    local lower = function(k1, k2)\n        return not upper(k1, k2)\n    end\n\n    local function count()\n        return #a\n    end\n\n    local function _swap(k1, k2)\n        local old_k1 = a[k1]\n        a[k1] = a[k2]\n        a[k2] = old_k1\n    end\n\n    local function upheap(newk)\n        local ku = floor(newk / 2)\n        local k = newk\n        while ku > 0 and lower(ku, k) do\n            _swap(ku, k)\n            k = floor(k/2)\n            ku = floor(ku/2)\n        end\n    end\n    \n    local insert = table.insert\n    local function insertq(e)\n        insert(a, e)\n        upheap(#a)\n    end\n    \n    local function downheap(newk)\n        local k = newk\n        while k <= floor(#a/2) do\n            local kdl = k*2\n            local kdr = kdl + 1\n            local kd\n            if kdr <= #a and lower(kdl, kdr) then\n                kd = kdr\n            else\n                kd = kdl\n            end\n            if upper(k, kd) then\n                break\n            end\n            _swap(k, kd)\n            k = kd\n        end\n    end\n    \n    local function top()\n        --assert(#a >= 1)\n        return a[1]\n    end\n    \n    local remove = table.remove\n    local function remove_top()\n        --assert(#a >= 1)\n        local v = a[1]\n        _swap(1, #a)\n        remove(a)\n        downheap(1)\n        return v\n    end\n\n    local self = {}\n    self.count = count\n    self.insertq = insertq\n    self.top = top\n    self.remove_top = remove_top\n    return self\nend\n\n---\nlocal N, M = io.read(\"*n\", \"*n\")\nlocal q = Heap(function (x,y) return x > y end)\nlocal insertq = q.insertq\nlocal remove_top = q.remove_top\nfor i=1,N do\n    insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = remove_top()\n    top = top / 2\n    insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2133, "cpu_time_ms": 2103, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s585791836", "group_id": "codeNet:p02912", "input_text": "local floor = math.floor\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 = floor(newk / 2)\n    local k = newk\n    while ku > 0 and self.lower(ku, k) do\n        self:_swap(ku, k)\n        k = floor(k/2)\n        ku = floor(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 <= floor(#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 q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\n\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568596826, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s585791836.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s585791836", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local floor = math.floor\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 = floor(newk / 2)\n    local k = newk\n    while ku > 0 and self.lower(ku, k) do\n        self:_swap(ku, k)\n        k = floor(k/2)\n        ku = floor(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 <= floor(#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 q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"*n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\n\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1882, "cpu_time_ms": 651, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s452771820", "group_id": "codeNet:p02912", "input_text": "local floor = math.floor\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 = floor(newk / 2)\n    local k = newk\n    while ku > 0 and self.lower(ku, k) do\n        self:_swap(ku, k)\n        k = floor(k/2)\n        ku = floor(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 <= floor(#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 q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\n\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568596744, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s452771820.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s452771820", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "local floor = math.floor\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 = floor(newk / 2)\n    local k = newk\n    while ku > 0 and self.lower(ku, k) do\n        self:_swap(ku, k)\n        k = floor(k/2)\n        ku = floor(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 <= floor(#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 q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\n\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + floor(top)\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1879, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s211111729", "group_id": "codeNet:p02912", "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---\nlocal N, M = io.read(\"n\", \"n\")\nlocal q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + math.floor(top)\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1568596596, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s211111729.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s211111729", "user_id": "u162773977"}, "prompt_components": {"gold_output": "9\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---\nlocal N, M = io.read(\"n\", \"n\")\nlocal q = Heap.new(function (x,y) return x > y end)\nfor i=1,N do\n    q:insertq(io.read(\"n\"))\nend\nfor i=1,M do\n    local top = q:remove_top()\n    top = top / 2\n    q:insertq(top)\nend\nlocal sum = 0\nfor i=1,N do\n    local top = q:remove_top()\n    sum = sum + math.floor(top)\nend\nprint(sum)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1827, "cpu_time_ms": 2103, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s588649096", "group_id": "codeNet:p02912", "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, 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.recalc = 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.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 = {}\nlocal c = {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  c[i] = 1\nend\nlocal tary = {}\nfor i = 1, n do tary[i] = i end\nlocal st = SegTree.new(tary, function(x, y)\n  if x == 0 then\n    return y\n  elseif y == 0 then\n    return x\n  else\n    if t[x] * c[y] < t[y] * c[x] then\n      return y\n    else\n      return x\n    end\n  end\nend, 0)\n\nfor i = 1, m do\n  local top = st.stage[1][1]\n  c[top] = c[top] * 2\n  st:recalc(top)\nend\nlocal ret = 0\nfor i = 1, n do\n  ret = ret + mfl(t[i] / c[i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568596528, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lua/s588649096.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s588649096", "user_id": "u120582723"}, "prompt_components": {"gold_output": "9\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, 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.recalc = 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.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 = {}\nlocal c = {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  c[i] = 1\nend\nlocal tary = {}\nfor i = 1, n do tary[i] = i end\nlocal st = SegTree.new(tary, function(x, y)\n  if x == 0 then\n    return y\n  elseif y == 0 then\n    return x\n  else\n    if t[x] * c[y] < t[y] * c[x] then\n      return y\n    else\n      return x\n    end\n  end\nend, 0)\n\nfor i = 1, m do\n  local top = st.stage[1][1]\n  c[top] = c[top] * 2\n  st:recalc(top)\nend\nlocal ret = 0\nfor i = 1, n do\n  ret = ret + mfl(t[i] / c[i])\nend\nprint(ret)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\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\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 minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2671, "cpu_time_ms": 85, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s148021952", "group_id": "codeNet:p02913", "input_text": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self)\n  self.sufa = {}\n  local n = #self.str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  local tmp_tbl = {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = self.str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n    tmp_tbl[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    stepflag = not stepflag\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 minormap = {}\n    local cur = 0\n    for i = 1, n do\n      local minor = v[stepdst[idx[i]]]\n      if minormap[minor] then minormap[minor] = minormap[minor] + 1\n      else minormap[minor] = 1\n      end\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif minor_min ~= minor_max then\n          local minortbl = {}\n          for k, _u in pairs(minormap) do table.insert(minortbl, k) end\n          table.sort(minortbl)\n          local offset = 0\n          for i = 1, #minortbl do\n            local cnt = minormap[minortbl[i]]\n            minormap[minortbl[i]] = i\n            minortbl[i] = offset -- reuse\n            offset = offset + cnt\n          end\n          -- local t = {}\n          -- for j = left, right do\n          --   tmp_tbl[j - left + 1] = 0\n          -- end\n          for j = left, right do\n            local idxj = idx[j]\n            local minor_idx = minormap[v[stepdst[idxj]]]\n            local ofst = minortbl[minor_idx]\n            ofst = ofst + 1\n            minortbl[minor_idx] = ofst\n            tmp_tbl[ofst] = idxj\n            vd[idxj] = cur + minor_idx\n          end\n          cur = cur + #minortbl\n          for j = left, right do\n            idx[j] = tmp_tbl[j - left + 1]\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          minormap = {}\n        end\n      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA()\n  self:makeLCPA()\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1588214871, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s148021952.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s148021952", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self)\n  self.sufa = {}\n  local n = #self.str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  local tmp_tbl = {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = self.str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n    tmp_tbl[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    stepflag = not stepflag\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 minormap = {}\n    local cur = 0\n    for i = 1, n do\n      local minor = v[stepdst[idx[i]]]\n      if minormap[minor] then minormap[minor] = minormap[minor] + 1\n      else minormap[minor] = 1\n      end\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif minor_min ~= minor_max then\n          local minortbl = {}\n          for k, _u in pairs(minormap) do table.insert(minortbl, k) end\n          table.sort(minortbl)\n          local offset = 0\n          for i = 1, #minortbl do\n            local cnt = minormap[minortbl[i]]\n            minormap[minortbl[i]] = i\n            minortbl[i] = offset -- reuse\n            offset = offset + cnt\n          end\n          -- local t = {}\n          -- for j = left, right do\n          --   tmp_tbl[j - left + 1] = 0\n          -- end\n          for j = left, right do\n            local idxj = idx[j]\n            local minor_idx = minormap[v[stepdst[idxj]]]\n            local ofst = minortbl[minor_idx]\n            ofst = ofst + 1\n            minortbl[minor_idx] = ofst\n            tmp_tbl[ofst] = idxj\n            vd[idxj] = cur + minor_idx\n          end\n          cur = cur + #minortbl\n          for j = left, right do\n            idx[j] = tmp_tbl[j - left + 1]\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          minormap = {}\n        end\n      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA()\n  self:makeLCPA()\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4500, "cpu_time_ms": 153, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s494212570", "group_id": "codeNet:p02913", "input_text": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self)\n  self.sufa = {}\n  local n = #self.str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = self.str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    -- print(\"A\", table.concat(idx, \" \"))\n    -- print(\"V\", table.concat(v, \" \"))\n    -- print(\"VD\", table.concat(vd, \" \"))\n    stepflag = not stepflag\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 minormap = {}\n    local cur = 0\n    for i = 1, n do\n      local minor = v[stepdst[idx[i]]]\n      if minormap[minor] then minormap[minor] = minormap[minor] + 1\n      else minormap[minor] = 1\n      end\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif minor_min ~= minor_max then\n          --\n          local minortbl = {}\n          for k, _u in pairs(minormap) do table.insert(minortbl, k) end\n          table.sort(minortbl)\n          local offset = 0\n          for i = 1, #minortbl do\n            local tmp = minormap[minortbl[i]]\n            minormap[minortbl[i]] = i\n            minortbl[i] = offset -- reuse\n            offset = offset + tmp\n          end\n          local t = {}\n          for j = left, right do\n            t[j - left + 1] = 0\n          end\n          for j = left, right do\n            local idxj = idx[j]\n            local minor_idx = minormap[v[stepdst[idxj]]]\n            local ofst = minortbl[minor_idx]\n            ofst = ofst + 1\n            minortbl[minor_idx] = ofst\n            t[ofst] = idxj\n            vd[idxj] = cur + minor_idx\n          end\n          cur = cur + #minortbl\n          for j = left, right do\n            idx[j] = t[j - left + 1]\n          end\n          -- local t = {}\n          -- for j = left, right do\n          --   t[j - left + 1] = idx[j]\n          -- end\n          -- print(\"Sort\", #t)\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          minormap = {}\n        end\n      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA()\n  self:makeLCPA()\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1588214567, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s494212570.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s494212570", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self)\n  self.sufa = {}\n  local n = #self.str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = self.str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    -- print(\"A\", table.concat(idx, \" \"))\n    -- print(\"V\", table.concat(v, \" \"))\n    -- print(\"VD\", table.concat(vd, \" \"))\n    stepflag = not stepflag\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 minormap = {}\n    local cur = 0\n    for i = 1, n do\n      local minor = v[stepdst[idx[i]]]\n      if minormap[minor] then minormap[minor] = minormap[minor] + 1\n      else minormap[minor] = 1\n      end\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif minor_min ~= minor_max then\n          --\n          local minortbl = {}\n          for k, _u in pairs(minormap) do table.insert(minortbl, k) end\n          table.sort(minortbl)\n          local offset = 0\n          for i = 1, #minortbl do\n            local tmp = minormap[minortbl[i]]\n            minormap[minortbl[i]] = i\n            minortbl[i] = offset -- reuse\n            offset = offset + tmp\n          end\n          local t = {}\n          for j = left, right do\n            t[j - left + 1] = 0\n          end\n          for j = left, right do\n            local idxj = idx[j]\n            local minor_idx = minormap[v[stepdst[idxj]]]\n            local ofst = minortbl[minor_idx]\n            ofst = ofst + 1\n            minortbl[minor_idx] = ofst\n            t[ofst] = idxj\n            vd[idxj] = cur + minor_idx\n          end\n          cur = cur + #minortbl\n          for j = left, right do\n            idx[j] = t[j - left + 1]\n          end\n          -- local t = {}\n          -- for j = left, right do\n          --   t[j - left + 1] = idx[j]\n          -- end\n          -- print(\"Sort\", #t)\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          minormap = {}\n        end\n      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA()\n  self:makeLCPA()\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5133, "cpu_time_ms": 167, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s816367681", "group_id": "codeNet:p02913", "input_text": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self, str)\n  self.sufa = {}\n  local n = #str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    stepflag = not stepflag\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif 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      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA(str)\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\n-- sample\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1588210559, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s816367681.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816367681", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal TranSufA = {}\nTranSufA.makeSufA = function(self, str)\n  self.sufa = {}\n  local n = #str\n  local idx, tbl1, tbl2 = self.sufa, {}, {}\n  for i = 1, n do\n    idx[i] = i\n    tbl1[i] = str:sub(i, i):byte() - 95 -- \"a\" = 97\n    tbl2[i] = 0\n  end\n  idx[n + 1], tbl1[n + 1], tbl2[n + 1] = n + 1, 1, 0\n  n = n + 1 -- add empty to last\n  table.sort(idx, function(a, b) return tbl1[a] < tbl1[b] end)\n  local step, stepflag = 1, true\n  while step < n do\n    local v = stepflag and tbl1 or tbl2\n    local vd = stepflag and tbl2 or tbl1\n    stepflag = not stepflag\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 left == right then\n          cur = cur + 1\n          vd[idx[left]] = cur\n        elseif 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      end\n    end\n    step = step * 2\n  end\n  -- remove empty from first (O(N))\n  table.remove(self.sufa, 1)\n  n = n - 1\n  self.sufa_inv = {}\n  for i = 1, n do self.sufa_inv[i] = 0 end\n  for i = 1, n do\n    self.sufa_inv[self.sufa[i]] = i\n  end\nend\nTranSufA.makeLCPA = function(self)\n  assert(self.sufa)\n  local n = #self.sufa\n  self.lcpa = {}\n  local str, sufa, lcpa = self.str, self.sufa, self.lcpa\n  for i = 1, n - 1 do lcpa[i] = 0 end\n  local spos = 0\n  for i = 1, n do\n    local lcppos = self.sufa_inv[i]\n    if lcppos < n then\n      local len = spos\n      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]\n      p1, p2 = p1 + spos, p2 + spos\n      while p1 <= n and p2 <= n do\n        if str:sub(p1, p1) == str:sub(p2, p2) then\n          len = len + 1\n          p1, p2 = p1 + 1, p2 + 1\n        else break\n        end\n      end\n      lcpa[lcppos] = len\n      spos = mma(0, len - 1)\n    end\n  end\nend\n\nTranSufA.create = function(self, str)\n  self.str = str\n  self:makeSufA(str)\nend\n\nTranSufA.new = function(str)\n  local obj = {}\n  setmetatable(obj, {__index = TranSufA})\n  obj:create(str)\n  return obj\nend\n\n-- sample\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = TranSufA.new(s)\nsa:makeLCPA()\n-- print(table.concat(sa.sufa, \" \"))\n-- print(table.concat(sa.sufa_inv, \" \"))\n-- print(table.concat(sa.lcpa, \" \"))\n\nlocal sufa, sufa_inv, lcpa = sa.sufa, sa.sufa_inv, sa.lcpa\nlocal ret = 0\nfor i = 1, n - 1 do\n  local len = lcpa[i]\n  local cand = len\n  local p1, p2 = sufa[i], sufa[i + 1]\n  if p1 < p2 then\n    ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n  else\n    ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n  end\n  for j = i + 1, n - 1 do\n    p2 = sufa[j + 1]\n    len = mmi(len, lcpa[j])\n    if p1 < p2 then\n      ret = mma(ret, mmi(len, p2 - p1, n + 1 - p2))\n    else\n      ret = mma(ret, mmi(len, p1 - p2, n + 1 - p1))\n    end\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3853, "cpu_time_ms": 197, "memory_kb": 2176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793360498", "group_id": "codeNet:p02913", "input_text": "local mmi, mma, mab = math.min, math.max, math.abs\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  lcpa[i] = c\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  local prv = lcpa[i]\n  for j = i, n - 1 do\n    local nxt = lcpa[j]\n    if nxt == 0 then\n      break\n    else\n      prv = mmi(prv, nxt)\n      ret = mma(ret, mmi(prv, mab(sa[j + 1][1] - sa[i][1])))\n    end\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1576818078, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s793360498.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s793360498", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma, mab = math.min, math.max, math.abs\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  lcpa[i] = c\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  local prv = lcpa[i]\n  for j = i, n - 1 do\n    local nxt = lcpa[j]\n    if nxt == 0 then\n      break\n    else\n      prv = mmi(prv, nxt)\n      ret = mma(ret, mmi(prv, mab(sa[j + 1][1] - sa[i][1])))\n    end\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 353, "memory_kb": 13056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s342401371", "group_id": "codeNet:p02913", "input_text": "local mfl, mce, mmi, mma = math.floor, math.ceil, math.min, 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, 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 = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\n\nlocal sa_inv = {}\nfor i = 1, n do sa_inv[i] = 0 end\nfor i = 1, n do sa_inv[sa[i][1]] = i end\n\nlocal lcpaSeg = SegTree.new(n - 1, mmi, 0)\nlocal lcpa = {}\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  lcpaSeg:setValue(i, c, true)\nend\nlcpaSeg:updateAll()\nlocal function getLcpLength(pos1, pos2)\n  local sapos1, sapos2 = sa_inv[pos1], sa_inv[pos2]\n  if sapos1 == sapos2 then\n    return #sa[sapos1][2]\n  elseif sapos2 < sapos1 then\n    sapos1, sapos2 = sapos2, sapos1\n  end\n  return lcpaSeg:getRange(sapos1, sapos2 - 1)\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(getLcpLength(i, j), j - i))\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1576771462, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s342401371.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s342401371", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mfl, mce, mmi, mma = math.floor, math.ceil, math.min, 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, 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 = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\n\nlocal sa_inv = {}\nfor i = 1, n do sa_inv[i] = 0 end\nfor i = 1, n do sa_inv[sa[i][1]] = i end\n\nlocal lcpaSeg = SegTree.new(n - 1, mmi, 0)\nlocal lcpa = {}\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  lcpaSeg:setValue(i, c, true)\nend\nlcpaSeg:updateAll()\nlocal function getLcpLength(pos1, pos2)\n  local sapos1, sapos2 = sa_inv[pos1], sa_inv[pos2]\n  if sapos1 == sapos2 then\n    return #sa[sapos1][2]\n  elseif sapos2 < sapos1 then\n    sapos1, sapos2 = sapos2, sapos1\n  end\n  return lcpaSeg:getRange(sapos1, sapos2 - 1)\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(getLcpLength(i, j), j - i))\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3144, "cpu_time_ms": 2105, "memory_kb": 28416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s576241261", "group_id": "codeNet:p02913", "input_text": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n do\n  lcpa[i] = {}\n  for j = 1, n do\n    lcpa[i][j] = 0\n  end\nend\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  local i1, i2 = sa[i][1], sa[i + 1][1]\n  lcpa[i1][i2], lcpa[i2][i1] = c, c\nend\nfor i = 1, n - 2 do\n  local prv = lcpa[sa[i][1]][sa[i + 1][1]]\n  if 0 < prv then\n    for j = i + 1, n - 1 do\n      local nxt = lcpa[sa[j][1]][sa[j + 1][1]]\n      if nxt == 0 then\n        break\n      else\n        prv = mmi(prv, nxt)\n        lcpa[sa[i][1]][sa[j + 1][1]], lcpa[sa[j + 1][1]][sa[i][1]] = prv, prv\n      end\n    end\n  end\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(lcpa[i][j], j - i))\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1576038447, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s576241261.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576241261", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n do\n  lcpa[i] = {}\n  for j = 1, n do\n    lcpa[i][j] = 0\n  end\nend\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  local i1, i2 = sa[i][1], sa[i + 1][1]\n  lcpa[i1][i2], lcpa[i2][i1] = c, c\nend\nfor i = 1, n - 2 do\n  local prv = lcpa[sa[i][1]][sa[i + 1][1]]\n  if 0 < prv then\n    for j = i + 1, n - 1 do\n      local nxt = lcpa[sa[j][1]][sa[j + 1][1]]\n      if nxt == 0 then\n        break\n      else\n        prv = mmi(prv, nxt)\n        lcpa[sa[i][1]][sa[j + 1][1]], lcpa[sa[j + 1][1]][sa[i][1]] = prv, prv\n      end\n    end\n  end\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(lcpa[i][j], j - i))\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1039, "cpu_time_ms": 1151, "memory_kb": 337024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s169678138", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n do\n  lcpa[i] = {}\n  for j = 1, n do\n    lcpa[i][j] = 0\n  end\nend\nlocal mmi, mma = math.min, math.max\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  local i1, i2 = sa[i][1], sa[i + 1][1]\n  lcpa[i1][i2], lcpa[i2][i1] = c, c\nend\nfor i = 1, n - 2 do\n  local prv = lcpa[sa[i][1]][sa[i + 1][1]]\n  if 0 < prv then\n    for j = i + 1, n - 1 do\n      local nxt = lcpa[sa[j][1]][sa[j + 1][1]]\n      if nxt == 0 then\n        break\n      else\n        prv = mmi(prv, nxt)\n        lcpa[sa[i][1]][sa[j + 1][1]], lcpa[sa[j + 1][1]][sa[i][1]] = prv, prv\n      end\n    end\n  end\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(j - i, lcpa[i][j]))\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568684042, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s169678138.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169678138", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal sa = {}\nfor i = 1, n do\n  table.insert(sa, {i, s:sub(i, n)})\nend\ntable.sort(sa, function(x, y) return x[2] < y[2] end)\nlocal lcpa = {}\nfor i = 1, n do\n  lcpa[i] = {}\n  for j = 1, n do\n    lcpa[i][j] = 0\n  end\nend\nlocal mmi, mma = math.min, math.max\nfor i = 1, n - 1 do\n  local len = mmi(#sa[i][2], #sa[i + 1][2])\n  local c = 0\n  for j = 1, len do\n    if sa[i][2]:sub(j, j) == sa[i + 1][2]:sub(j, j) then\n      c = c + 1\n    else break end\n  end\n  local i1, i2 = sa[i][1], sa[i + 1][1]\n  lcpa[i1][i2], lcpa[i2][i1] = c, c\nend\nfor i = 1, n - 2 do\n  local prv = lcpa[sa[i][1]][sa[i + 1][1]]\n  if 0 < prv then\n    for j = i + 1, n - 1 do\n      local nxt = lcpa[sa[j][1]][sa[j + 1][1]]\n      if nxt == 0 then\n        break\n      else\n        prv = mmi(prv, nxt)\n        lcpa[sa[i][1]][sa[j + 1][1]], lcpa[sa[j + 1][1]][sa[i][1]] = prv, prv\n      end\n    end\n  end\nend\nlocal ret = 0\nfor i = 1, n - 1 do\n  for j = i + 1, n do\n    ret = mma(ret, mmi(j - i, lcpa[i][j]))\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1039, "cpu_time_ms": 1151, "memory_kb": 336896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s796536041", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal bt = {}\nlocal mma, mmi = math.max, math.min\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\nlocal ret = 0\nfor i = 1, n do\n  local cnt = 0\n  for j = 1, n - i do\n    if bt[j] == bt[j + i] then\n      cnt = cnt + 1\n    else\n      cnt = 0\n    end\n    ret = mma(ret, mmi(i, cnt))\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568606139, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s796536041.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796536041", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal bt = {}\nlocal mma, mmi = math.max, math.min\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\nlocal ret = 0\nfor i = 1, n do\n  local cnt = 0\n  for j = 1, n - i do\n    if bt[j] == bt[j + i] then\n      cnt = cnt + 1\n    else\n      cnt = 0\n    end\n    ret = mma(ret, mmi(i, cnt))\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 120, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s081756538", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal bt = {}\nlocal mma, mmi = math.max, math.min\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\nlocal ret = 0\nfor i = 1, n do\n  local cnt = 0\n  for j = 1, n - i do\n    if bt[j] == bt[j + i] then\n      cnt = cnt + 1\n    else\n      cnt = 0\n    end\n    print(i, j, ret, cnt)\n    ret = mma(ret, mmi(i, cnt))\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568606109, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s081756538.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s081756538", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal bt = {}\nlocal mma, mmi = math.max, math.min\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\nlocal ret = 0\nfor i = 1, n do\n  local cnt = 0\n  for j = 1, n - i do\n    if bt[j] == bt[j + i] then\n      cnt = cnt + 1\n    else\n      cnt = 0\n    end\n    print(i, j, ret, cnt)\n    ret = mma(ret, mmi(i, cnt))\n  end\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 2103, "memory_kb": 22016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s270772467", "group_id": "codeNet:p02913", "input_text": "local floor = math.floor\n-- binary search\n-- https://golang.org/src/sort/search.go?s=2246:2286#L49\nlocal function find_min_true(n, f)\n    local function loop(i, j)\n        if i == j then\n            return i\n        end\n        local h = floor((i + j) / 2)\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\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal S = io.read(\"*l\")\nlocal sub = string.sub\nlocal find = string.find\nlocal function search()\n    -- false if len is OK\n    local function judge(len)\n        for l1=1,N+1-2*len do\n            local subst = sub(S, l1, l1+len-1)\n            local result = find(S, subst, l1+len, true)\n            --print(\"len\", len, \"l1\", l1, \"subst\", subst, \"result\", result)\n            if result then\n                return false\n            end\n        end\n        return true -- len is NG\n    end\n    return find_min_true(2500, judge)\nend\nlocal ans = search()\nif ans == 0 then\n    print(0)\nelse\n    print(ans-1)\nend", "language": "Lua", "metadata": {"date": 1568603654, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s270772467.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s270772467", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local floor = math.floor\n-- binary search\n-- https://golang.org/src/sort/search.go?s=2246:2286#L49\nlocal function find_min_true(n, f)\n    local function loop(i, j)\n        if i == j then\n            return i\n        end\n        local h = floor((i + j) / 2)\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\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal S = io.read(\"*l\")\nlocal sub = string.sub\nlocal find = string.find\nlocal function search()\n    -- false if len is OK\n    local function judge(len)\n        for l1=1,N+1-2*len do\n            local subst = sub(S, l1, l1+len-1)\n            local result = find(S, subst, l1+len, true)\n            --print(\"len\", len, \"l1\", l1, \"subst\", subst, \"result\", result)\n            if result then\n                return false\n            end\n        end\n        return true -- len is NG\n    end\n    return find_min_true(2500, judge)\nend\nlocal ans = search()\nif ans == 0 then\n    print(0)\nelse\n    print(ans-1)\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1041, "cpu_time_ms": 904, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s549123850", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal thash = {}\nif 6 <= n then\n  thash[1]\n    = bt[1]\n    + bt[2] * 30\n    + bt[3] * 900\n    + bt[4] * 27000\n    + bt[5] * 810000\n    + bt[6] * 24300000\n  for k = 2, n - 5 do\n    thash[k] = mfl(thash[k - 1] / 30) + bt[k + 5] * 24300000\n  end\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local tmplen = len\n    local hash = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      hash[thash[pos + len - 5]] = true\n      if hash[thash[pos - 5]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n        end\n        taskpos = pos\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  local nextnt = false\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if nextnt and 8 < lmax - lmin then\n      len = mfl((lmax + 7 * lmin) / 8)\n      nextnt = false\n    end\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n      nextnt = true\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568601067, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s549123850.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s549123850", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal thash = {}\nif 6 <= n then\n  thash[1]\n    = bt[1]\n    + bt[2] * 30\n    + bt[3] * 900\n    + bt[4] * 27000\n    + bt[5] * 810000\n    + bt[6] * 24300000\n  for k = 2, n - 5 do\n    thash[k] = mfl(thash[k - 1] / 30) + bt[k + 5] * 24300000\n  end\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local tmplen = len\n    local hash = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      hash[thash[pos + len - 5]] = true\n      if hash[thash[pos - 5]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n        end\n        taskpos = pos\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  local nextnt = false\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if nextnt and 8 < lmax - lmin then\n      len = mfl((lmax + 7 * lmin) / 8)\n      nextnt = false\n    end\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n      nextnt = true\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1683, "cpu_time_ms": 2104, "memory_kb": 13312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s647270819", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal thash = {}\nif 6 <= n then\n  thash[1]\n    = bt[1]\n    + bt[2] * 30\n    + bt[3] * 900\n    + bt[4] * 27000\n    + bt[5] * 810000\n    + bt[6] * 24300000\n  for k = 2, n - 5 do\n    thash[k] = mfl(thash[k - 1] / 30) + bt[k + 5] * 24300000\n  end\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local hash = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      hash[thash[pos + len - 5]] = true\n      if hash[thash[pos - 5]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n        end\n        taskpos = pos\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568600359, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s647270819.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s647270819", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal thash = {}\nif 6 <= n then\n  thash[1]\n    = bt[1]\n    + bt[2] * 30\n    + bt[3] * 900\n    + bt[4] * 27000\n    + bt[5] * 810000\n    + bt[6] * 24300000\n  for k = 2, n - 5 do\n    thash[k] = mfl(thash[k - 1] / 30) + bt[k + 5] * 24300000\n  end\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local hash = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      hash[thash[pos + len - 5]] = true\n      if hash[thash[pos - 5]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n        end\n        taskpos = pos\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1510, "cpu_time_ms": 2104, "memory_kb": 13440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462883795", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local hash = {}\n    local tmap = {}\n    local thash = {}\n    thash[1]\n      = bt[len - 5]\n      + bt[len - 4] * 30\n      + bt[len - 3] * 900\n      + bt[len - 2] * 27000\n      + bt[len - 1] * 810000\n      + bt[len] * 24300000\n    for k = 2, n - len + 1 do\n      thash[k] = mfl(thash[k - 1] / 30) + bt[k + len - 1] * 24300000\n    end\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      -- map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n          taskpos = pos\n        end\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568599702, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s462883795.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s462883795", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal function solve(len)\n  if 6 <= len then\n    local hlen = mfl(len / 2)\n    local map = {}\n    local hash = {}\n    local tmap = {}\n    local thash = {}\n    thash[1]\n      = bt[len - 5]\n      + bt[len - 4] * 30\n      + bt[len - 3] * 900\n      + bt[len - 2] * 27000\n      + bt[len - 1] * 810000\n      + bt[len] * 24300000\n    for k = 2, n - len + 1 do\n      thash[k] = mfl(thash[k - 1] / 30) + bt[k + len - 1] * 24300000\n    end\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    local taskpos = n - len + 1\n    for pos = n - len, len, -1 do\n      -- map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] then\n        for tmp = pos + 1, taskpos do\n          map[tmap[tmp]] = true\n          taskpos = pos\n        end\n        if map[tmap[pos + 1 - len]] then\n          return true\n        end\n      end\n    end\n  else\n    local map = {}\n    local tmap = {}\n    for k = 1, n - len + 1 do\n      tmap[k] = s:sub(k, k + len - 1)\n    end\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1595, "cpu_time_ms": 2104, "memory_kb": 13056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s425177428", "group_id": "codeNet:p02913", "input_text": "local floor = math.floor\n-- binary search\n-- https://golang.org/src/sort/search.go?s=2246:2286#L49\nlocal function find_min_true(n, f)\n    local function loop(i, j)\n        if i == j then\n            return i\n        end\n        local h = floor((i + j) / 2)\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\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal S = io.read(\"*l\")\nlocal sub = string.sub\nlocal find = string.find\nlocal function search()\n    -- false if len is OK\n    local function judge(len)\n        for l1=1,N+1-2*len do\n            local subst = sub(S, l1, l1+len-1)\n            local result = find(S, subst, l1+len, true)\n            --print(\"len\", len, \"l1\", l1, \"subst\", subst, \"result\", result)\n            if result then\n                return false\n            end\n        end\n        return true -- len is NG\n    end\n    return find_min_true(2500, judge)\nend\nlocal ans = search()\nif ans == 0 then\n    print(0)\nelse\n    print(ans-1)\nend", "language": "Lua", "metadata": {"date": 1568599465, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s425177428.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425177428", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local floor = math.floor\n-- binary search\n-- https://golang.org/src/sort/search.go?s=2246:2286#L49\nlocal function find_min_true(n, f)\n    local function loop(i, j)\n        if i == j then\n            return i\n        end\n        local h = floor((i + j) / 2)\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\n\nlocal N = io.read(\"*n\", \"*l\")\nlocal S = io.read(\"*l\")\nlocal sub = string.sub\nlocal find = string.find\nlocal function search()\n    -- false if len is OK\n    local function judge(len)\n        for l1=1,N+1-2*len do\n            local subst = sub(S, l1, l1+len-1)\n            local result = find(S, subst, l1+len, true)\n            --print(\"len\", len, \"l1\", l1, \"subst\", subst, \"result\", result)\n            if result then\n                return false\n            end\n        end\n        return true -- len is NG\n    end\n    return find_min_true(2500, judge)\nend\nlocal ans = search()\nif ans == 0 then\n    print(0)\nelse\n    print(ans-1)\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1041, "cpu_time_ms": 983, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s732170448", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal function solve(len)\n  local hlen = mfl(len / 2)\n  local map = {}\n  local hash = {}\n  local tmap = {}\n  local thash = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n    if 6 <= len then\n      thash[k] = bt[k]\n        + bt[k + 1] * 30\n        + bt[k + hlen] * 900\n        + bt[k + hlen + 1] * 27000\n        + bt[k + len - 2] * 810000\n        + bt[k + len - 1] * 24300000\n    end\n  end\n  if 6 <= len then\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] and map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  else\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568598951, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s732170448.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s732170448", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nlocal bt = {}\nfor i = 1, n do\n  bt[i] = s:sub(i, i):byte() - 97\nend\n\nlocal function solve(len)\n  local hlen = mfl(len / 2)\n  local map = {}\n  local hash = {}\n  local tmap = {}\n  local thash = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n    if 6 <= len then\n      thash[k] = bt[k]\n        + bt[k + 1] * 30\n        + bt[k + hlen] * 900\n        + bt[k + hlen + 1] * 27000\n        + bt[k + len - 2] * 810000\n        + bt[k + len - 1] * 24300000\n    end\n  end\n  if 6 <= len then\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] and map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  else\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1235, "cpu_time_ms": 2104, "memory_kb": 13184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s266214581", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  local hash = {}\n  local tmap = {}\n  local thash = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n    if 5 <= len then\n      thash[k] =\n        (tmap[k]:sub(1, 1):byte() - 97) +\n        (tmap[k]:sub(2, 2):byte() - 97) * 30 +\n        (tmap[k]:sub(3, 3):byte() - 97) * 900 +\n        (tmap[k]:sub(len - 1, len - 1):byte() - 97) * 27000 +\n        (tmap[k]:sub(len, len):byte() - 97) * 810000\n    end\n  end\n  if 5 <= len then\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] and map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  else\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568598617, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s266214581.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s266214581", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  local hash = {}\n  local tmap = {}\n  local thash = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n    if 5 <= len then\n      thash[k] =\n        (tmap[k]:sub(1, 1):byte() - 97) +\n        (tmap[k]:sub(2, 2):byte() - 97) * 30 +\n        (tmap[k]:sub(3, 3):byte() - 97) * 900 +\n        (tmap[k]:sub(len - 1, len - 1):byte() - 97) * 27000 +\n        (tmap[k]:sub(len, len):byte() - 97) * 810000\n    end\n  end\n  if 5 <= len then\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      hash[thash[pos + 1]] = true\n      if hash[thash[pos + 1 - len]] and map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  else\n    for pos = n - len, len, -1 do\n      map[tmap[pos + 1]] = true\n      if map[tmap[pos + 1 - len]] then\n        return true\n      end\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 2104, "memory_kb": 12416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s801865843", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  local tmap = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n  end\n  for pos = n - len, len, -1 do\n    map[tmap[pos + 1]] = true\n    if map[tmap[pos + 1 - len]] then\n      return true\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568598028, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s801865843.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s801865843", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  local tmap = {}\n  for k = 1, n - len + 1 do\n    tmap[k] = s:sub(k, k + len - 1)\n  end\n  for pos = n - len, len, -1 do\n    map[tmap[pos + 1]] = true\n    if map[tmap[pos + 1 - len]] then\n      return true\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 637, "cpu_time_ms": 2103, "memory_kb": 12672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s085607876", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  for pos = n - len, 1, -1 do\n    map[s:sub(pos + 1, pos + len)] = true\n    if map[s:sub(pos + 1 - len, pos)] then\n      return true\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n    -- print(len, lmin, lmax)\n  end\n  print(lmin)\nend\n", "language": "Lua", "metadata": {"date": 1568597736, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s085607876.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s085607876", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\n\nlocal function solve(len)\n  local map = {}\n  for pos = n - len, 1, -1 do\n    map[s:sub(pos + 1, pos + len)] = true\n    if map[s:sub(pos + 1 - len, pos)] then\n      return true\n    end\n  end\n  return false\nend\nif not solve(1) then\n  print(0)\nelse\n  local lmin, lmax = 1, maxlen + 1\n  while 1 < lmax - lmin do\n    local len = mfl((lmax + lmin) / 2)\n    if solve(len) then\n      lmin = len\n    else\n      lmax = len\n    end\n    -- print(len, lmin, lmax)\n  end\n  print(lmin)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 2104, "memory_kb": 11904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s054368000", "group_id": "codeNet:p02913", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nfor len = maxlen, 1, -1 do\n  local map = {}\n  for pos = n - len, 1, -1 do\n    map[s:sub(pos + 1, pos + len)] = true\n    if map[s:sub(pos + 1 - len, pos)] then\n      print(len)\n      found = true\n      break\n    end\n  end\n  if found then break end\nend\nif not found then\n  print(0)\nend\n", "language": "Lua", "metadata": {"date": 1568597224, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lua/s054368000.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s054368000", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal mfl = math.floor\nlocal maxlen = mfl(n / 2)\nlocal found = false\nfor len = maxlen, 1, -1 do\n  local map = {}\n  for pos = n - len, 1, -1 do\n    map[s:sub(pos + 1, pos + len)] = true\n    if map[s:sub(pos + 1 - len, pos)] then\n      print(len)\n      found = true\n      break\n    end\n  end\n  if found then break end\nend\nif not found then\n  print(0)\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\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 maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 12932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s282175300", "group_id": "codeNet:p02933", "input_text": "a=io.read(\"*n\")\nl=io.read()--改行の読み込み\ns=io.read()\nif a<3200 then\n  print(\"red\")\nelse\n  print(s)\nend", "language": "Lua", "metadata": {"date": 1579314037, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s282175300.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s282175300", "user_id": "u720483676"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "a=io.read(\"*n\")\nl=io.read()--改行の読み込み\ns=io.read()\nif a<3200 then\n  print(\"red\")\nelse\n  print(s)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s568953262", "group_id": "codeNet:p02933", "input_text": "local a=io.read(\"*n\")\nlocal l=io.read()\nlocal s=io.read()\nif a>=3200 then\n  print(s)\nelse\n  print(\"red\")\nend", "language": "Lua", "metadata": {"date": 1576478176, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s568953262.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568953262", "user_id": "u373958718"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a=io.read(\"*n\")\nlocal l=io.read()\nlocal s=io.read()\nif a>=3200 then\n  print(s)\nelse\n  print(\"red\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s450794512", "group_id": "codeNet:p02933", "input_text": "local a=io.read(\"*n\")\nlocal l=io.read()\nlocal s=io.read()\nif a>=3200 then\n  print(s)\nelse\n  print(\"red\")\nend", "language": "Lua", "metadata": {"date": 1576478161, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s450794512.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s450794512", "user_id": "u373958718"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a=io.read(\"*n\")\nlocal l=io.read()\nlocal s=io.read()\nif a>=3200 then\n  print(s)\nelse\n  print(\"red\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s357885977", "group_id": "codeNet:p02933", "input_text": "local a,s = io.read(\"*n\",\"*l\")\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "language": "Lua", "metadata": {"date": 1566528587, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s357885977.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s357885977", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a,s = io.read(\"*n\",\"*l\")\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s850189022", "group_id": "codeNet:p02933", "input_text": "local a = io.stdin:read()\nlocal s = io.stdin:read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "language": "Lua", "metadata": {"date": 1566528226, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s850189022.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s850189022", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.stdin:read()\nlocal s = io.stdin:read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s961669794", "group_id": "codeNet:p02933", "input_text": "local a = io.read(\"*l\")\nif tonumber(a) >= 3200 then\n  print(io.read())\nelse\n  print('red')\nend", "language": "Lua", "metadata": {"date": 1566359839, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s961669794.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961669794", "user_id": "u959346025"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read(\"*l\")\nif tonumber(a) >= 3200 then\n  print(io.read())\nelse\n  print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 94, "cpu_time_ms": 5, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s357093278", "group_id": "codeNet:p02933", "input_text": "local a = io.read(\"*n\",\"*l\")\nlocal s = io.read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "language": "Lua", "metadata": {"date": 1566339252, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s357093278.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357093278", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read(\"*n\",\"*l\")\nlocal s = io.read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s526318828", "group_id": "codeNet:p02933", "input_text": "local a = io.read(\"*n\",\"*l\")\nlocal s = io.read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print(\"red\")\nend", "language": "Lua", "metadata": {"date": 1566339168, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s526318828.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s526318828", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read(\"*n\",\"*l\")\nlocal s = io.read()\n\nif a >= 3200 then\n  print(s)\nelse \n  print(\"red\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s994910294", "group_id": "codeNet:p02933", "input_text": "local a = io.read(\"*n\")\nlocal s = io.read(\"*l\")\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "language": "Lua", "metadata": {"date": 1566339075, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s994910294.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s994910294", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal s = io.read(\"*l\")\n\nif a >= 3200 then\n  print(s)\nelse \n  print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s572535783", "group_id": "codeNet:p02933", "input_text": "local a = io.stdin:read();\nlocal s = io.stdin:read();\n", "language": "Lua", "metadata": {"date": 1566333080, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s572535783.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s572535783", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.stdin:read();\nlocal s = io.stdin:read();\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 54, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s827223271", "group_id": "codeNet:p02933", "input_text": "local a = io.stdin:read();\nlocal s = io.stdin:read();\nprint(3200 <= a and s or \"red\")", "language": "Lua", "metadata": {"date": 1566333058, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s827223271.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s827223271", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.stdin:read();\nlocal s = io.stdin:read();\nprint(3200 <= a and s or \"red\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s932105749", "group_id": "codeNet:p02933", "input_text": "while true do\n  local a =io.read()\n  if a == nil then return end\n  print(a)\nend\n\nwhile true do\n  local s =io.read()\n  if s == nil then return end\n  print(s)\nend\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "language": "Lua", "metadata": {"date": 1566331886, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s932105749.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s932105749", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "while true do\n  local a =io.read()\n  if a == nil then return end\n  print(a)\nend\n\nwhile true do\n  local s =io.read()\n  if s == nil then return end\n  print(s)\nend\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s874390659", "group_id": "codeNet:p02933", "input_text": "while true do\n    local a = io.read()\n    local s = io.read()\n    if a  == nil then return end\n    print(a)\n    if s  == nil then return end\n      print(s)\nend\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "language": "Lua", "metadata": {"date": 1566331438, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s874390659.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s874390659", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "while true do\n    local a = io.read()\n    local s = io.read()\n    if a  == nil then return end\n    print(a)\n    if s  == nil then return end\n      print(s)\nend\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s676171529", "group_id": "codeNet:p02933", "input_text": "local a = io.stdin:read();\nlocal s = io.stdin:read();\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "language": "Lua", "metadata": {"date": 1566330310, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s676171529.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s676171529", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.stdin:read();\nlocal s = io.stdin:read();\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s237987964", "group_id": "codeNet:p02933", "input_text": "local a = io.read()\nlocal s = io.read()\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend\n", "language": "Lua", "metadata": {"date": 1566182290, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s237987964.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s237987964", "user_id": "u918364989"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read()\nlocal s = io.read()\n\nif a >= 3200 then\n    print(s)\nelse \n    print('red')\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 884}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s296283773", "group_id": "codeNet:p02933", "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})\n-- A\nlocal a, _, s = read.nll()\nif a >= 3200 then print(s)\nelse print(\"red\") end", "language": "Lua", "metadata": {"date": 1566176493, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s296283773.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s296283773", "user_id": "u162773977"}, "prompt_components": {"gold_output": "pink\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})\n-- A\nlocal a, _, s = read.nll()\nif a >= 3200 then print(s)\nelse print(\"red\") end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 10, "memory_kb": 1012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s078198486", "group_id": "codeNet:p02933", "input_text": "local a = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nprint(3200 <= a and s or \"red\")\n", "language": "Lua", "metadata": {"date": 1566176463, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lua/s078198486.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s078198486", "user_id": "u120582723"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "local a = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nprint(3200 <= a and s or \"red\")\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 10, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s173304882", "group_id": "codeNet:p02936", "input_text": "local n, q = io.read(\"*n\", \"*n\")\nlocal cost = {}\nlocal edge = {}\nlocal asked = {}\nfor i = 1, n do\n  cost[i] = 0\n  edge[i] = {}\n  asked[i] = false\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\nfor iq = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\nlocal tasks = {1}\nfor i = 1, n do\n  local p = tasks[i]\n  asked[p] = true\n  local e = edge[p]\n  for j = 1, #e do\n    local c = e[j]\n    if not asked[c] then\n      table.insert(tasks, c)\n      cost[c] = cost[c] + cost[p]\n    end\n  end\nend\nprint(table.concat(cost, \" \"))\n", "language": "Lua", "metadata": {"date": 1595707063, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s173304882.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s173304882", "user_id": "u120582723"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local n, q = io.read(\"*n\", \"*n\")\nlocal cost = {}\nlocal edge = {}\nlocal asked = {}\nfor i = 1, n do\n  cost[i] = 0\n  edge[i] = {}\n  asked[i] = false\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\nfor iq = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\nlocal tasks = {1}\nfor i = 1, n do\n  local p = tasks[i]\n  asked[p] = true\n  local e = edge[p]\n  for j = 1, #e do\n    local c = e[j]\n    if not asked[c] then\n      table.insert(tasks, c)\n      cost[c] = cost[c] + cost[p]\n    end\n  end\nend\nprint(table.concat(cost, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 476, "memory_kb": 57384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s486647748", "group_id": "codeNet:p02936", "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,q=io.read(\"*n\",\"*n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "language": "Lua", "metadata": {"date": 1592024451, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s486647748.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s486647748", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\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,q=io.read(\"*n\",\"*n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1436, "cpu_time_ms": 572, "memory_kb": 46732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s010029878", "group_id": "codeNet:p02936", "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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "language": "Lua", "metadata": {"date": 1592024390, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s010029878.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010029878", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1430, "cpu_time_ms": 608, "memory_kb": 54496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s082369631", "group_id": "codeNet:p02936", "input_text": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"*n\",\"*n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] and not edge[b][a] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "language": "Lua", "metadata": {"date": 1591939372, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s082369631.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082369631", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"*n\",\"*n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] and not edge[b][a] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1449, "cpu_time_ms": 609, "memory_kb": 46728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s044259477", "group_id": "codeNet:p02936", "input_text": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] and not edge[b][a] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "language": "Lua", "metadata": {"date": 1591939271, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s044259477.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s044259477", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\n    edge[b][a]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] and not edge[b][a] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                edge[b][a]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1443, "cpu_time_ms": 640, "memory_kb": 54500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s080009105", "group_id": "codeNet:p02936", "input_text": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "language": "Lua", "metadata": {"date": 1591938444, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s080009105.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s080009105", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "--https://www.lua.org/pil/11.4.html\nList = {}\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,q=io.read(\"n\",\"n\")\nlocal edge={}\nlocal counter={}\nfor i=1,n do\n    counter[i]=0\n    edge[i]={}\nend\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    edge[a][b]=false\nend\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    counter[p]=counter[p]+x\nend\n\nlocal que=List.new()\nList.pushright(que,1)\n\nwhile true do\n    local a=List.popleft(que)\n    if a then\n        for b,_ in pairs(edge[a]) do\n            if not edge[a][b] then\n                counter[b]=counter[b]+counter[a]\n                edge[a][b]=true\n                List.pushright(que,b)\n            end\n        end\n    else\n        break\n    end\nend\n\nprint(table.concat(counter,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1371, "cpu_time_ms": 483, "memory_kb": 46692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s435827394", "group_id": "codeNet:p02936", "input_text": "local n,q=io.read(\"n\",\"n\")\n\nlocal edge={}\nlocal c={}\nfor i=1,n do\n    c[i]=0\nend\n\nlocal function dfs(i,k)\n    for j=1,#edge[i] do\n        if j~=k then\n            c[edge[j]]=(c[edge[j]] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=c[p]+x\nend\n\ndfs(1,-1)\nprint(table.concat(c,\" \"))", "language": "Lua", "metadata": {"date": 1591920517, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s435827394.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s435827394", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local n,q=io.read(\"n\",\"n\")\n\nlocal edge={}\nlocal c={}\nfor i=1,n do\n    c[i]=0\nend\n\nlocal function dfs(i,k)\n    for j=1,#edge[i] do\n        if j~=k then\n            c[edge[j]]=(c[edge[j]] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=c[p]+x\nend\n\ndfs(1,-1)\nprint(table.concat(c,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 560, "cpu_time_ms": 512, "memory_kb": 59996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s979545047", "group_id": "codeNet:p02936", "input_text": "local n,q=io.read(\"n\",\"n\")\n\nlocal edge={}\nlocal c={}\nlocal function dfs(i,k)\n    if #edge[i]>0 then\n        for _,j in pairs(edge[i]) do\n            if j~=k then\n                c[j]=(c[j] or 0)+(c[i] or 0)\n                dfs(j,i)\n            end\n        end\n    end\nend\nfor i=1,n do\n    c[i]=0\nend\n\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=c[p]+x\nend\n\ndfs(1,-1)\nprint(table.concat(c,\" \"))", "language": "Lua", "metadata": {"date": 1591919314, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s979545047.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s979545047", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local n,q=io.read(\"n\",\"n\")\n\nlocal edge={}\nlocal c={}\nlocal function dfs(i,k)\n    if #edge[i]>0 then\n        for _,j in pairs(edge[i]) do\n            if j~=k then\n                c[j]=(c[j] or 0)+(c[i] or 0)\n                dfs(j,i)\n            end\n        end\n    end\nend\nfor i=1,n do\n    c[i]=0\nend\n\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=c[p]+x\nend\n\ndfs(1,-1)\nprint(table.concat(c,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 560, "memory_kb": 59488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s100206644", "group_id": "codeNet:p02936", "input_text": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    if #edge[i]>0 then\n        for _,j in pairs(edge[i]) do\n            if j~=k then\n                c[j]=(c[j] or 0)+(c[i] or 0)\n                dfs(j,i)\n            end\n        end\n    end\nend\n\nlocal n,q=io.read(\"n\",\"n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "language": "Lua", "metadata": {"date": 1591918831, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s100206644.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s100206644", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    if #edge[i]>0 then\n        for _,j in pairs(edge[i]) do\n            if j~=k then\n                c[j]=(c[j] or 0)+(c[i] or 0)\n                dfs(j,i)\n            end\n        end\n    end\nend\n\nlocal n,q=io.read(\"n\",\"n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 588, "cpu_time_ms": 591, "memory_kb": 68576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s127299760", "group_id": "codeNet:p02936", "input_text": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    for _,j in pairs(edge[i]) do\n        if j~=k then\n            c[j]=(c[j] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nlocal n,q=io.read(\"n\",\"n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "language": "Lua", "metadata": {"date": 1591918580, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s127299760.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s127299760", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    for _,j in pairs(edge[i]) do\n        if j~=k then\n            c[j]=(c[j] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nlocal n,q=io.read(\"n\",\"n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"n\",\"n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"n\",\"n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 564, "memory_kb": 67296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s083296786", "group_id": "codeNet:p02936", "input_text": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    for _,j in pairs(edge[i]) do\n        if j~=k then\n            c[j]=(c[j] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nlocal n,q=io.read(\"*n\",\"*n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "language": "Lua", "metadata": {"date": 1591918512, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s083296786.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s083296786", "user_id": "u045238009"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local edge={}\nlocal c={}\nlocal function dfs(i,k)\n    for _,j in pairs(edge[i]) do\n        if j~=k then\n            c[j]=(c[j] or 0)+(c[i] or 0)\n            dfs(j,i)\n        end\n    end\nend\n\nlocal n,q=io.read(\"*n\",\"*n\")\nfor i=1,n-1 do\n    local a,b=io.read(\"*n\",\"*n\")\n    if not edge[a] then\n        edge[a]={}\n    end\n    if not edge[b] then\n        edge[b]={}\n    end\n    table.insert(edge[a],b)\n    table.insert(edge[b],a)\nend\n\nfor i=1,q do\n    local p,x=io.read(\"*n\",\"*n\")\n    c[p]=(c[p] or 0)+x\nend\n\ndfs(1,0)\nprint(table.concat(c,\" \"))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 480, "memory_kb": 30108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s644089597", "group_id": "codeNet:p02936", "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 readnn = read.nn\nlocal readn32 = read[(\"n\"):rep(32)]\nlocal N, Q = readnn()\nlocal edges = {}\nfor i=1,N//16 do\n    edges[i] = {} edges[i+1] = {} edges[i+2] = {} edges[i+3] = {}\n    edges[i+4] = {} edges[i+5] = {} edges[i+6] = {} edges[i+7] = {}\n    edges[i+8] = {} edges[i+9] = {} edges[i+10] = {} edges[i+11] = {}\n    edges[i+12] = {} edges[i+13] = {} edges[i+14] = {} edges[i+15] = {}\nend\nfor i=(N//16)+1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,(N-1)//16 do\n    local a1,b1,a2,b2,a3,b3,a4,b4,a5,b5,a6,b6,a7,b7,a8,b8,\n            a9,b9,a10,b10,a11,b11,a12,b12,a13,b13,a14,b14,a15,b15,a16,b16 = readn32()\n    insert(edges[a1], b1)\n    insert(edges[b2], a2)\n    insert(edges[a3], b3)\n    insert(edges[b4], a4)\n    insert(edges[a5], b5)\n    insert(edges[b6], a6)\n    insert(edges[a7], b7)\n    insert(edges[b8], a8)\n    insert(edges[b9], a9)\n    insert(edges[a10], b10)\n    insert(edges[a11], b11)\n    insert(edges[a12], b12)\n    insert(edges[a13], b13)\n    insert(edges[a14], b14)\n    insert(edges[a15], b15)\n    insert(edges[a16], b16)\nend\nfor i=((N-1)//16)+1,N-1 do\n    local a,b = readnn()\n    insert(edges[a], b)\nend\n", "language": "Lua", "metadata": {"date": 1584718302, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s644089597.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s644089597", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 readnn = read.nn\nlocal readn32 = read[(\"n\"):rep(32)]\nlocal N, Q = readnn()\nlocal edges = {}\nfor i=1,N//16 do\n    edges[i] = {} edges[i+1] = {} edges[i+2] = {} edges[i+3] = {}\n    edges[i+4] = {} edges[i+5] = {} edges[i+6] = {} edges[i+7] = {}\n    edges[i+8] = {} edges[i+9] = {} edges[i+10] = {} edges[i+11] = {}\n    edges[i+12] = {} edges[i+13] = {} edges[i+14] = {} edges[i+15] = {}\nend\nfor i=(N//16)+1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,(N-1)//16 do\n    local a1,b1,a2,b2,a3,b3,a4,b4,a5,b5,a6,b6,a7,b7,a8,b8,\n            a9,b9,a10,b10,a11,b11,a12,b12,a13,b13,a14,b14,a15,b15,a16,b16 = readn32()\n    insert(edges[a1], b1)\n    insert(edges[b2], a2)\n    insert(edges[a3], b3)\n    insert(edges[b4], a4)\n    insert(edges[a5], b5)\n    insert(edges[b6], a6)\n    insert(edges[a7], b7)\n    insert(edges[b8], a8)\n    insert(edges[b9], a9)\n    insert(edges[a10], b10)\n    insert(edges[a11], b11)\n    insert(edges[a12], b12)\n    insert(edges[a13], b13)\n    insert(edges[a14], b14)\n    insert(edges[a15], b15)\n    insert(edges[a16], b16)\nend\nfor i=((N-1)//16)+1,N-1 do\n    local a,b = readnn()\n    insert(edges[a], b)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1450, "cpu_time_ms": 297, "memory_kb": 27896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s721009694", "group_id": "codeNet:p02936", "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, Q = read.nn()\nfor i=1,N-1 do\n    local a, b = read.nn()\nend\n", "language": "Lua", "metadata": {"date": 1584717664, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s721009694.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s721009694", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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, Q = read.nn()\nfor i=1,N-1 do\n    local a, b = read.nn()\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 347, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s123353113", "group_id": "codeNet:p02936", "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, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\n", "language": "Lua", "metadata": {"date": 1584717589, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s123353113.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s123353113", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 501, "cpu_time_ms": 801, "memory_kb": 88696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s070056801", "group_id": "codeNet:p02936", "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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs(node, prev, accum)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    for j=1,#adjs do\n        local next = adjs[j]\n        if next ~= prev then\n            dfs(next, node, accum)\n        end\n    end\nend\ndfs(1, -1, 0)\nprint(table.concat(C, ' '))\n", "language": "Lua", "metadata": {"date": 1584332353, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s070056801.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s070056801", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs(node, prev, accum)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    for j=1,#adjs do\n        local next = adjs[j]\n        if next ~= prev then\n            dfs(next, node, accum)\n        end\n    end\nend\ndfs(1, -1, 0)\nprint(table.concat(C, ' '))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 917, "memory_kb": 57132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s681731476", "group_id": "codeNet:p02936", "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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs(node, prev, accum)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    for j=1,#adjs do\n        local next = adjs[j]\n        if next ~= prev then\n            dfs(next, node, accum)\n        end\n    end\nend\ndfs(1, -1, 0)\nprint(table.concat(C, ' '))\n", "language": "Lua", "metadata": {"date": 1584332337, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s681731476.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s681731476", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs(node, prev, accum)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    for j=1,#adjs do\n        local next = adjs[j]\n        if next ~= prev then\n            dfs(next, node, accum)\n        end\n    end\nend\ndfs(1, -1, 0)\nprint(table.concat(C, ' '))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1319, "memory_kb": 148052}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s027984958", "group_id": "codeNet:p02936", "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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "language": "Lua", "metadata": {"date": 1584332157, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s027984958.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s027984958", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1830, "cpu_time_ms": 1359, "memory_kb": 128852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710827175", "group_id": "codeNet:p02936", "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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "language": "Lua", "metadata": {"date": 1584332055, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s710827175.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710827175", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nlocal insert = table.insert\nfor i=1,N-1 do\n    local a, b = read.nn()\n    insert(edges[a], b)\n    insert(edges[b], a)\nend\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1830, "cpu_time_ms": 1964, "memory_kb": 227832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361084360", "group_id": "codeNet:p02936", "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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = read.nn()\n    table.insert(edges[a], b)\n    table.insert(edges[b], a)\nend\nlocal q = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "language": "Lua", "metadata": {"date": 1584331870, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s361084360.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s361084360", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 N, Q = read.nn()\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = read.nn()\n    table.insert(edges[a], b)\n    table.insert(edges[b], a)\nend\nlocal q = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    q[p] = q[p] + x\nend\n\nlocal C = {}\nfor i=1,N do\n    C[i] = 0\nend\nlocal function dfs_cps(node, prev, accum, cont)\n    accum = accum + q[node]\n    C[node] = accum\n    local adjs = edges[node]\n    local function make_cont(j)\n        return function()\n            local next = adjs[j]\n            if next then\n                if next ~= prev then\n                    return dfs_cps(next, node, accum, make_cont(j+1))\n                else\n                    return make_cont(j+1)()\n                end\n            else\n                return cont()\n            end\n        end\n    end\n    return make_cont(1)()\nend\ndfs_cps(1, -1, 0, function()\n    print(table.concat(C, ' '))\nend)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1793, "cpu_time_ms": 2072, "memory_kb": 227808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s733554932", "group_id": "codeNet:p02936", "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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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, Q = read.nn()\nlocal G = array(1)\nfor i=1,N-1 do\n    local a, b = read.nn()\n    G[a] = G[a] or {}\n    G[b] = G[b] or {}\n    table.insert(G[a], b)\n    table.insert(G[b], a)\nend\nlocal A = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    A[p] = A[p] + x\nend\n\nlocal counter = array(1, 0)\nlocal function dfs()\n    local seen = {}\n    local stack = {}\n    local function push(t)\n        table.insert(stack, t)\n    end\n    local function pop()\n        return table.remove(stack)\n    end\n    push({1, 0})\n    while #stack > 0 do\n        local p, cur = table.unpack(pop())\n        cur = cur + A[p]\n        counter[p] = cur\n        seen[p] = 1\n        for k,v in pairs(G[p]) do\n            local child = v\n            if not seen[child] then\n                push({child, cur})\n            end\n        end\n    end\nend\ndfs()\nprint(table.concat(counter, \" \"))\n", "language": "Lua", "metadata": {"date": 1583013278, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s733554932.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733554932", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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 tostringxx(o, depth) depth = depth or 0 if depth > 10 then return \"<too deep!>\" 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, Q = read.nn()\nlocal G = array(1)\nfor i=1,N-1 do\n    local a, b = read.nn()\n    G[a] = G[a] or {}\n    G[b] = G[b] or {}\n    table.insert(G[a], b)\n    table.insert(G[b], a)\nend\nlocal A = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    A[p] = A[p] + x\nend\n\nlocal counter = array(1, 0)\nlocal function dfs()\n    local seen = {}\n    local stack = {}\n    local function push(t)\n        table.insert(stack, t)\n    end\n    local function pop()\n        return table.remove(stack)\n    end\n    push({1, 0})\n    while #stack > 0 do\n        local p, cur = table.unpack(pop())\n        cur = cur + A[p]\n        counter[p] = cur\n        seen[p] = 1\n        for k,v in pairs(G[p]) do\n            local child = v\n            if not seen[child] then\n                push({child, cur})\n            end\n        end\n    end\nend\ndfs()\nprint(table.concat(counter, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3458, "cpu_time_ms": 1720, "memory_kb": 144992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s143214052", "group_id": "codeNet:p02936", "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, Q = read.nn()\nlocal G = array(2)\nfor i=1,N-1 do\n    local a, b = read.nn()\n    G[a][b] = 1\n    G[b][a] = 1\nend\nlocal A = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    A[p] = A[p] + x\nend\n\nlocal counter = array(1, 0)\nlocal seen = {}\nlocal function rec(parent, cur)\n    cur = cur + A[parent]\n    counter[parent] = cur\n    seen[parent] = 1\n    for k in pairs(G[parent]) do\n        local child = k\n        if not seen[child] then\n            rec(child, cur)\n        end\n    end\nend\nrec(1, 0)\nprint(table.concat(counter, \" \"))\n", "language": "Lua", "metadata": {"date": 1583009477, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s143214052.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s143214052", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\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, Q = read.nn()\nlocal G = array(2)\nfor i=1,N-1 do\n    local a, b = read.nn()\n    G[a][b] = 1\n    G[b][a] = 1\nend\nlocal A = array(1, 0)\nfor i=1,Q do\n    local p, x = read.nn()\n    A[p] = A[p] + x\nend\n\nlocal counter = array(1, 0)\nlocal seen = {}\nlocal function rec(parent, cur)\n    cur = cur + A[parent]\n    counter[parent] = cur\n    seen[parent] = 1\n    for k in pairs(G[parent]) do\n        local child = k\n        if not seen[child] then\n            rec(child, cur)\n        end\n    end\nend\nrec(1, 0)\nprint(table.concat(counter, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1375, "cpu_time_ms": 1598, "memory_kb": 158432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958659718", "group_id": "codeNet:p02936", "input_text": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(edges[a], b)\n    table.insert(edges[b], a)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal seen = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    if not seen[node] then\n        seen[node] = true\n        task_insert_ptr = task_insert_ptr + 1\n        task[task_insert_ptr] = {node, accum}\n    end\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, adj in ipairs(edges[node]) do\n        task_add(adj, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "language": "Lua", "metadata": {"date": 1566209371, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s958659718.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958659718", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal edges = {}\nfor i=1,N do\n    edges[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(edges[a], b)\n    table.insert(edges[b], a)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal seen = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    if not seen[node] then\n        seen[node] = true\n        task_insert_ptr = task_insert_ptr + 1\n        task[task_insert_ptr] = {node, accum}\n    end\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, adj in ipairs(edges[node]) do\n        task_add(adj, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1084, "cpu_time_ms": 674, "memory_kb": 82912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s774231687", "group_id": "codeNet:p02936", "input_text": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    task_insert_ptr = task_insert_ptr + 1\n    task[task_insert_ptr] = {node, accum}\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        task_add(child, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "language": "Lua", "metadata": {"date": 1566190896, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s774231687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s774231687", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    task_insert_ptr = task_insert_ptr + 1\n    task[task_insert_ptr] = {node, accum}\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        task_add(child, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 985, "cpu_time_ms": 509, "memory_kb": 67704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s399024667", "group_id": "codeNet:p02936", "input_text": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    task_insert_ptr = task_insert_ptr + 1\n    task[task_insert_ptr] = {node, accum}\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        task_add(child, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "language": "Lua", "metadata": {"date": 1566187517, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s399024667.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s399024667", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "-- D\nlocal N, Q = io.read(\"*n\", \"*n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"*n\", \"*n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"*n\", \"*n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\n\nlocal task = {}\nlocal task_insert_ptr = 0\nlocal function task_add(node, accum)\n    task_insert_ptr = task_insert_ptr + 1\n    task[task_insert_ptr] = {node, accum}\nend\ntask_add(1, 0)\nlocal task_remove_ptr = 1\nlocal function task_remove()\n    local t = task[task_remove_ptr]\n    local n, a = t[1], t[2]\n    task_remove_ptr = task_remove_ptr + 1\n    return n, a\nend\nwhile #task >= task_remove_ptr do\n    local node, accum = task_remove()\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        task_add(child, accum + inc)\n    end\nend\n\nprint(table.concat(counters, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 985, "cpu_time_ms": 523, "memory_kb": 67704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s353164126", "group_id": "codeNet:p02936", "input_text": "local n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal cost = {}\nlocal visited = {}\nfor i = 1, n do\n  edge[i] = {}\n  cost[i] = 0\n  visited[i] = false\nend\nfor i = 1, n - 1 do\n  local a, b = io.read(\"*n\", \"*n\")\n  edge[a][b] = true\n  edge[b][a] = true\nend\nfor i = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\n\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nlocal function addtask(idx)\n  if not taskstate[idx] then\n    taskstate[idx] = true\n    tasknum = tasknum + 1\n    tasks[tasknum] = idx\n    visited[idx] = true\n  end\nend\naddtask(1)\n\nwhile done < tasknum do\n  done = done + 1\n  local src = tasks[done]\n  taskstate[src] = false\n  for dst, unused in pairs(edge[src]) do\n    if not visited[dst] then\n      cost[dst] = cost[dst] + cost[src]\n      addtask(dst)\n    end\n  end\nend\nprint(table.concat(cost, \" \"))\n", "language": "Lua", "metadata": {"date": 1566187148, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s353164126.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353164126", "user_id": "u120582723"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal cost = {}\nlocal visited = {}\nfor i = 1, n do\n  edge[i] = {}\n  cost[i] = 0\n  visited[i] = false\nend\nfor i = 1, n - 1 do\n  local a, b = io.read(\"*n\", \"*n\")\n  edge[a][b] = true\n  edge[b][a] = true\nend\nfor i = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\n\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nlocal function addtask(idx)\n  if not taskstate[idx] then\n    taskstate[idx] = true\n    tasknum = tasknum + 1\n    tasks[tasknum] = idx\n    visited[idx] = true\n  end\nend\naddtask(1)\n\nwhile done < tasknum do\n  done = done + 1\n  local src = tasks[done]\n  taskstate[src] = false\n  for dst, unused in pairs(edge[src]) do\n    if not visited[dst] then\n      cost[dst] = cost[dst] + cost[src]\n      addtask(dst)\n    end\n  end\nend\nprint(table.concat(cost, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 500, "memory_kb": 52864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s124014379", "group_id": "codeNet:p02936", "input_text": "-- D\nlocal N, Q = io.read(\"n\", \"n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"n\", \"n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"n\", \"n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\nlocal function dfs(node, accum)\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        dfs(child, accum + inc)\n    end\nend\n\ndfs(1, 0)\n\nprint(table.concat(counters, \" \"))\n", "language": "Lua", "metadata": {"date": 1566186462, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s124014379.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s124014379", "user_id": "u162773977"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "-- D\nlocal N, Q = io.read(\"n\", \"n\")\nlocal children = {}\nfor i=1,N do\n    children[i] = {}\nend\nfor i=1,N-1 do\n    local a, b = io.read(\"n\", \"n\")\n    table.insert(children[a], b)\nend\n\nlocal q = {}\nfor i=1,N do\n    q[i] = 0\nend\nfor i=1,Q do\n    local p, x = io.read(\"n\", \"n\")\n    q[p] = q[p] + x\nend\n\nlocal counters = {}\nfor i=1,N do\n    counters[i] = 0\nend\nlocal function dfs(node, accum)\n    local inc = q[node]\n    counters[node] = accum + inc\n    for k, child in ipairs(children[node]) do\n        dfs(child, accum + inc)\n    end\nend\n\ndfs(1, 0)\n\nprint(table.concat(counters, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 581, "cpu_time_ms": 400, "memory_kb": 63480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s305069959", "group_id": "codeNet:p02936", "input_text": "local n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal cost = {}\nfor i = 1, n do\n  edge[i] = {}\n  cost[i] = 0\nend\nfor i = 1, n - 1 do\n  local a, b = io.read(\"*n\", \"*n\")\n  edge[a][b] = true\nend\nfor i = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\n\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nlocal function addtask(idx)\n  if not taskstate[idx] then\n    taskstate[idx] = true\n    tasknum = tasknum + 1\n    tasks[tasknum] = idx\n  end\nend\naddtask(1)\n\nwhile done < tasknum do\n  done = done + 1\n  local src = tasks[done]\n  taskstate[src] = false\n  for dst, unused in pairs(edge[src]) do\n    cost[dst] = cost[dst] + cost[src]\n    addtask(dst)\n  end\nend\nprint(table.concat(cost, \" \"))\n", "language": "Lua", "metadata": {"date": 1566177042, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lua/s305069959.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305069959", "user_id": "u120582723"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "local n, q = io.read(\"*n\", \"*n\")\nlocal edge = {}\nlocal cost = {}\nfor i = 1, n do\n  edge[i] = {}\n  cost[i] = 0\nend\nfor i = 1, n - 1 do\n  local a, b = io.read(\"*n\", \"*n\")\n  edge[a][b] = true\nend\nfor i = 1, q do\n  local p, x = io.read(\"*n\", \"*n\")\n  cost[p] = cost[p] + x\nend\n\n\nlocal taskstate = {}\nfor i = 1, n do taskstate[i] = false end\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nlocal function addtask(idx)\n  if not taskstate[idx] then\n    taskstate[idx] = true\n    tasknum = tasknum + 1\n    tasks[tasknum] = idx\n  end\nend\naddtask(1)\n\nwhile done < tasknum do\n  done = done + 1\n  local src = tasks[done]\n  taskstate[src] = false\n  for dst, unused in pairs(edge[src]) do\n    cost[dst] = cost[dst] + cost[src]\n    addtask(dst)\n  end\nend\nprint(table.concat(cost, \" \"))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\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\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 514, "memory_kb": 48764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s269255936", "group_id": "codeNet:p02949", "input_text": "local n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nlocal srcs, dsts, cs = {}, {}, {}\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  srcs[i] = a\n  dsts[i] = b\n  cs[i] = c - p\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = srcs[j], dsts[j], cs[j]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = srcs[j], dsts[j], cs[j]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and -1 or math.max(0, len[n]))\n", "language": "Lua", "metadata": {"date": 1594176986, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s269255936.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269255936", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nlocal srcs, dsts, cs = {}, {}, {}\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  srcs[i] = a\n  dsts[i] = b\n  cs[i] = c - p\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = srcs[j], dsts[j], cs[j]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = srcs[j], dsts[j], cs[j]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and -1 or math.max(0, len[n]))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 749, "cpu_time_ms": 1771, "memory_kb": 3152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s218462558", "group_id": "codeNet:p02949", "input_text": "local n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nlocal len = {}\nfor i = 1, n do\n  len[i] = {}\n  edge[i] = {}\nend\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  edge[i] = {a, b, c - p}\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and -1 or math.max(0, len[n]))\n", "language": "Lua", "metadata": {"date": 1586481575, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s218462558.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218462558", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nlocal len = {}\nfor i = 1, n do\n  len[i] = {}\n  edge[i] = {}\nend\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  edge[i] = {a, b, c - p}\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and -1 or math.max(0, len[n]))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 783, "cpu_time_ms": 387, "memory_kb": 896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s673714710", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local a = math.max(0,-d[N])\n    if a == 0 then a = 0 end\n    print(a)\nend", "language": "Lua", "metadata": {"date": 1579578695, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s673714710.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673714710", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local a = math.max(0,-d[N])\n    if a == 0 then a = 0 end\n    print(a)\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1076, "cpu_time_ms": 1716, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s624614098", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(-d[N],0))\nend", "language": "Lua", "metadata": {"date": 1579575415, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s624614098.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624614098", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(-d[N],0))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 1735, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s062681584", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = 10123456789\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "language": "Lua", "metadata": {"date": 1566068907, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s062681584.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s062681584", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = 10123456789\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 689, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s439197506", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "language": "Lua", "metadata": {"date": 1566068688, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s439197506.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s439197506", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 695, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s408382709", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "language": "Lua", "metadata": {"date": 1566068627, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s408382709.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s408382709", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(-d[N])\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 695, "cpu_time_ms": 21, "memory_kb": 1016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s145171291", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(math.max(0,-d[N]))\n", "language": "Lua", "metadata": {"date": 1566068533, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s145171291.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s145171291", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\nlocal d = bf()\nprint(math.max(0,-d[N]))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 10, "memory_kb": 1016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s319527524", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\n\nprint(math.max(0,-d[N]))\n", "language": "Lua", "metadata": {"date": 1566068404, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s319527524.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s319527524", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^5 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    return d\nend\n\nprint(math.max(0,-d[N]))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 693, "cpu_time_ms": 5, "memory_kb": 1016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s439774313", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,2*N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1566061497, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s439774313.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s439774313", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\nlocal function bf()\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,2*N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1033, "cpu_time_ms": 813, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s385674491", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1566048884, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s385674491.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s385674491", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1073, "cpu_time_ms": 2103, "memory_kb": 1144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s070495647", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1566048578, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s070495647.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s070495647", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = edges[j][1], edges[j][2], edges[j][3]\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1073, "cpu_time_ms": 541, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s371085216", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1566047406, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s371085216.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371085216", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1015, "cpu_time_ms": 1735, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s957036763", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^6 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local minus_d = -d[N]\n    if minus_d < 0 then\n        print(0)\n        return\n    end\n    os.execute(\"sleep 0.05\")\n    local tostr_minus_d = tostring(minus_d)\n    local strformat_minus_d = string.format(\"%d\", minus_d)\n    if string.find(tostr_minus_d, \"[.e]\") then\n        os.execute(\"sleep 0.100\")\n    end\n    if math.abs(minus_d) > 2^51 then\n        os.execute(\"sleep 0.200\")\n    end\n    if tonumber(strformat_minus_d) ~= minus_d then\n        os.execute(\"sleep 0.400\")\n    end\n    print(minus_d)\nend", "language": "Lua", "metadata": {"date": 1566047120, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s957036763.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s957036763", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^6 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local minus_d = -d[N]\n    if minus_d < 0 then\n        print(0)\n        return\n    end\n    os.execute(\"sleep 0.05\")\n    local tostr_minus_d = tostring(minus_d)\n    local strformat_minus_d = string.format(\"%d\", minus_d)\n    if string.find(tostr_minus_d, \"[.e]\") then\n        os.execute(\"sleep 0.100\")\n    end\n    if math.abs(minus_d) > 2^51 then\n        os.execute(\"sleep 0.200\")\n    end\n    if tonumber(strformat_minus_d) ~= minus_d then\n        os.execute(\"sleep 0.400\")\n    end\n    print(minus_d)\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1550, "cpu_time_ms": 57, "memory_kb": 980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s550337772", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M < 10^6 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local minus_d = -d[N]\n    if minus_d < 0 then\n        print(0)\n        return\n    end\n    os.execute(\"sleep 0.05\")\n    local tostr_minus_d = tostring(minus_d)\n    local strformat_minus_d = string.format(\"%d\", minus_d)\n    if string.find(tostr_minus_d, \"[.e]\") then\n        os.execute(\"sleep 0.100\")\n    end\n    if math.abs(minus_d) > 2^51 then\n        os.execute(\"sleep 0.200\")\n    end\n    if tonumber(strformat_minus_d) ~= minus_d then\n        os.execute(\"sleep 0.400\")\n    end\n    print(minus_d)\nend", "language": "Lua", "metadata": {"date": 1566046923, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s550337772.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s550337772", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M < 10^6 then\n    error()\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    local minus_d = -d[N]\n    if minus_d < 0 then\n        print(0)\n        return\n    end\n    os.execute(\"sleep 0.05\")\n    local tostr_minus_d = tostring(minus_d)\n    local strformat_minus_d = string.format(\"%d\", minus_d)\n    if string.find(tostr_minus_d, \"[.e]\") then\n        os.execute(\"sleep 0.100\")\n    end\n    if math.abs(minus_d) > 2^51 then\n        os.execute(\"sleep 0.200\")\n    end\n    if tonumber(strformat_minus_d) ~= minus_d then\n        os.execute(\"sleep 0.400\")\n    end\n    print(minus_d)\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1550, "cpu_time_ms": 1721, "memory_kb": 980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s220569974", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif string.find(_VERSION, \"5.1\") and N * M < 10^6 then\n    -- for b06\n    local f = io.open(\"in.txt\", \"w\")\n    f:write(table.concat({N, M, P}, \" \"))\n    f:write(\"\\n\")\n    for i=1,M do\n        local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n        f:write(table.concat({a,b,c}, \" \"))\n        f:write(\"\\n\")\n    end\n    f:close()\n    os.execute(\"cat in.txt | lua Main.lua\")\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565791554, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s220569974.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220569974", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif string.find(_VERSION, \"5.1\") and N * M < 10^6 then\n    -- for b06\n    local f = io.open(\"in.txt\", \"w\")\n    f:write(table.concat({N, M, P}, \" \"))\n    f:write(\"\\n\")\n    for i=1,M do\n        local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n        f:write(table.concat({a,b,c}, \" \"))\n        f:write(\"\\n\")\n    end\n    f:close()\n    os.execute(\"cat in.txt | lua Main.lua\")\n    return\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1409, "cpu_time_ms": 1737, "memory_kb": 1556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s761804803", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^6 then\n  error()\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\n    os.execute(\"sleep 0.6\")\nelse\n    print(math.max(0,-d[N]))\n    os.execute(\"sleep 0.3\")\nend", "language": "Lua", "metadata": {"date": 1565729570, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s761804803.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s761804803", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nif N * M > 10^6 then\n  error()\nend\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\n    os.execute(\"sleep 0.6\")\nelse\n    print(math.max(0,-d[N]))\n    os.execute(\"sleep 0.3\")\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1122, "cpu_time_ms": 606, "memory_kb": 980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s142999094", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565727856, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s142999094.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s142999094", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 2103, "memory_kb": 1144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s396700216", "group_id": "codeNet:p02949", "input_text": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565717039, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s396700216.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396700216", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local unpack = table.unpack or unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                local new_d = d[a] + w\n                if new_d < d[b] then\n                    d[b] = new_d\n                end\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = unpack(edges[j])\n            if d[a] ~= INF then\n                if d[a] + w < d[b] or d[a] == -INF then\n                    d[b] = -INF\n                end\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 1720, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s673527381", "group_id": "codeNet:p02949", "input_text": "table.unpack = unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565708324, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s673527381.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s673527381", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "table.unpack = unpack\nlocal INF = math.floor(10^10)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 969, "cpu_time_ms": 1979, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s974935307", "group_id": "codeNet:p02949", "input_text": "table.unpack = unpack\nlocal INF = math.floor(10^6)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565707855, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s974935307.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974935307", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "table.unpack = unpack\nlocal INF = math.floor(10^6)\nlocal N, M, P = io.read(\"*n\", \"*n\", \"*n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1966, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s634665767", "group_id": "codeNet:p02949", "input_text": "local INF = math.floor(10^6)\nlocal N, M, P = io.read(\"n\", \"n\", \"n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"n\", \"n\", \"n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "language": "Lua", "metadata": {"date": 1565707781, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s634665767.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s634665767", "user_id": "u162773977"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local INF = math.floor(10^6)\nlocal N, M, P = io.read(\"n\", \"n\", \"n\")\nlocal edges = {}\nfor i=1,M do\n    local a, b, c = io.read(\"n\", \"n\", \"n\")\n    edges[i] = {a, b, -1 * (c - P)}\nend\n\n\n-- Bellman-Ford\nlocal function bf()\n    -- distance from 1\n    local d = {}\n    for i=1,N do\n        d[i] = INF\n    end\n    d[1] = 0\n    for i=1,N-1 do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = new_d\n            end\n        end\n    end\n    for i=1,N do\n        for j=1,M do\n            local a, b, w = table.unpack(edges[j])\n            local new_d = (d[a] == INF) and INF or d[a] + w\n            if new_d < d[b] then\n                d[b] = -INF\n            end\n        end\n    end\n    return d\nend\n\nlocal d = bf()\nlocal negloop = d[N] == -INF\nif negloop then\n    print(-1)\nelse\n    print(math.max(0,-d[N]))\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 940, "cpu_time_ms": 2103, "memory_kb": 1144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s629910032", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  table.insert(edge, {a, b, c - p})\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and \"-1\" or mma(0, len[n]))\n", "language": "Lua", "metadata": {"date": 1565496937, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s629910032.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629910032", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*n\", \"*n\")\nlocal edge = {}\nfor i = 1, m do\n  local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\n  table.insert(edge, {a, b, c - p})\nend\nlocal len = {}\nlocal inf = 10000000000\nfor i = 1, n do len[i] = -inf end\nlen[1] = 0\nlocal lim = n + 4\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] ~= -inf and len[dst] < len[src] + c then\n      len[dst] = len[src] + c\n      if i == lim then\n        len[dst] = inf\n      end\n    end\n  end\nend\nfor i = 1, lim do\n  for j = 1, m do\n    local src, dst, c = edge[j][1], edge[j][2], edge[j][3]\n    if len[src] == inf then\n      len[dst] = inf\n    end\n  end\nend\nprint(inf <= len[n] and \"-1\" or mma(0, len[n]))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 747, "cpu_time_ms": 384, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s592085101", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + m + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + m + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565495673, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s592085101.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s592085101", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + m + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + m + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1503, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s728973495", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if m + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if m + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565495584, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s728973495.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s728973495", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if m + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if m + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s290085211", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    local taskidx = tasknum\n    tasks[taskidx] = idx\n    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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  local src = tasks[done]\n  taskstate[src] = false\n\n  for dst, cost in pairs(edge[src]) do\n    if len[dst] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565491258, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s290085211.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s290085211", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    local taskidx = tasknum\n    tasks[taskidx] = idx\n    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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  local src = tasks[done]\n  taskstate[src] = false\n\n  for dst, cost in pairs(edge[src]) do\n    if len[dst] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1564, "cpu_time_ms": 1263, "memory_kb": 66304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s525775731", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565491092, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s525775731.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s525775731", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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 - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1288, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s653483907", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\nlocal function addtask(idx, flg)\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 not flg then\n      updatecount[idx] = updatecount[idx] + 1\n    end\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] <= len[src] + cost then\n        local f = false\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          elseif len[dst] < len[src] + cost then\n            len[dst] = len[src] + cost\n          else\n            f = true\n          end\n        end\n        addtask(dst, f)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565489984, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s653483907.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s653483907", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\nlocal function addtask(idx, flg)\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 not flg then\n      updatecount[idx] = updatecount[idx] + 1\n    end\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] <= len[src] + cost then\n        local f = false\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          elseif len[dst] < len[src] + cost then\n            len[dst] = len[src] + cost\n          else\n            f = true\n          end\n        end\n        addtask(dst, f)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1636, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s713899752", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\nlocal function addtask(idx, flg)\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 not flg then\n      updatecount[idx] = updatecount[idx] + 1\n    end\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] <= len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          elseif len[dst] < len[src] + cost then\n            len[dst] = len[src] + cost\n          else\n            addtask(dst, true)\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565489884, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s713899752.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s713899752", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\nlocal function addtask(idx, flg)\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 not flg then\n      updatecount[idx] = updatecount[idx] + 1\n    end\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] <= len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          elseif len[dst] < len[src] + cost then\n            len[dst] = len[src] + cost\n          else\n            addtask(dst, true)\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1619, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s673664917", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "language": "Lua", "metadata": {"date": 1565489770, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s673664917.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s673664917", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 10000000000\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    updatecount[idx] = updatecount[idx] + 1\n  end\nend\naddtask(1)\n\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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        addtask(dst)\n      end\n    end\n  end\n  if n + 3 < updatecount[n] then len[n] = inf break end\nend\nif inf <= len[n] then\n  print(\"-1\")\nelse\n  print(mma(0, len[n]))\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1503, "cpu_time_ms": 1288, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s880041634", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        ret = addtask(dst) and ret\n      end\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565489445, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s880041634.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s880041634", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf then\n      if inf <= len[src] or len[dst] < len[src] + cost then\n        if n + 3 < updatecount[dst] then\n          len[dst] = inf\n        else\n          if inf <= len[src] then\n            len[dst] = inf\n          else\n            len[dst] = len[src] + cost\n          end\n        end\n        ret = addtask(dst) and ret\n      end\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1701, "cpu_time_ms": 1271, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s550838708", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        if inf <= len[src] then\n          len[dst] = inf\n        else\n          len[dst] = len[src] + cost\n        end\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565489057, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s550838708.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550838708", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        if inf <= len[src] then\n          len[dst] = inf\n        else\n          len[dst] = len[src] + cost\n        end\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1642, "cpu_time_ms": 1167, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s995938748", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        len[dst] = len[src] + cost\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565488982, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s995938748.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s995938748", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        len[dst] = len[src] + cost\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  if inf <= len[n] then\n    print(\"-1\")\n  else\n    print(mma(0, len[n]))\n  end\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1131, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s998994618", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        len[dst] = len[src] + cost\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565488921, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s998994618.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998994618", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal inf = 1000000000\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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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] < inf and len[dst] < len[src] + cost then\n      if n + 3 < updatecount[dst] then\n        len[dst] = inf\n      else\n        len[dst] = len[src] + cost\n      end\n      ret = addtask(dst) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1503, "cpu_time_ms": 1142, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s675348460", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal function addtask(idx)\n  if(not taskstate[idx]) and updatecount[idx] <= n + 3 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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565488563, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s675348460.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s675348460", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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 updatecount = {}\nfor i = 1, n do\n  updatecount[i] = 0\nend\nlocal function addtask(idx)\n  if(not taskstate[idx]) and updatecount[idx] <= n + 3 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    updatecount[idx] = updatecount[idx] + 1\n    if idx == n then\n      if n + 2 < updatecount[idx] 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) and ret\n    end\n  end\n  if not ret then break end\n  -- if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1406, "cpu_time_ms": 1061, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s285690391", "group_id": "codeNet:p02949", "input_text": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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) and ret\n    end\n  end\n  if not ret then break end\n  if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "language": "Lua", "metadata": {"date": 1565488374, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lua/s285690391.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s285690391", "user_id": "u120582723"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "local mma = math.max\nlocal n, m, p = io.read(\"*n\", \"*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  c = c - p\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) and ret\n    end\n  end\n  if not ret then break end\n  if 5000000 < done then break end\nend\nif ret then\n  print(mma(0, len[n]))\nelse\n  print(\"-1\")\nend\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1296, "cpu_time_ms": 906, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s733577858", "group_id": "codeNet:p02953", "input_text": "local n=io.read(\"n\")\nlocal previous=io.read(\"n\")-1\nlocal flag=true\nfor i=2,n do\n    local now=io.read(\"n\")\n    if previous<now then\n        previous=now-1\n    elseif previous>now then\n        flag=false\n    end\nend\nprint(flag and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1591067466, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s733577858.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733577858", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal previous=io.read(\"n\")-1\nlocal flag=true\nfor i=2,n do\n    local now=io.read(\"n\")\n    if previous<now then\n        previous=now-1\n    elseif previous>now then\n        flag=false\n    end\nend\nprint(flag and \"Yes\" or \"No\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s575105980", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<0)then\n\t\tH[i+1]=H[i+1]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"\n", "language": "Lua", "metadata": {"date": 1588431252, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s575105980.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575105980", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<0)then\n\t\tH[i+1]=H[i+1]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s300977467", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<0)then\n\t\tH[i+1]=H[i+1]-1\n\tend\nend\nprint(table.concat(H,\" \"))\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"\n", "language": "Lua", "metadata": {"date": 1588431245, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s300977467.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300977467", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<0)then\n\t\tH[i+1]=H[i+1]-1\n\tend\nend\nprint(table.concat(H,\" \"))\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 106, "memory_kb": 7288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s047979150", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "language": "Lua", "metadata": {"date": 1588430448, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s047979150.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s047979150", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 41, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s921369779", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<1)then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "language": "Lua", "metadata": {"date": 1588430311, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s921369779.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s921369779", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]<1)then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 27, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s525716120", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]>H[i+1])then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "language": "Lua", "metadata": {"date": 1588430126, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s525716120.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s525716120", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]>H[i+1])then\n\t\tH[i]=H[i]-1\n\tend\nend\nfor i=1,N-1 do\n\tif(H[i]-H[i+1]>0)then print\"No\"return end\nend\nprint\"Yes\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 27, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361935812", "group_id": "codeNet:p02953", "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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]>H[i+1])then\n\t\tH[i]=H[i]-1\n\t\tif(H[i]-H[i+1]>0)then print\"No\"return end\n\tend\nend\nprint\"Yes\"", "language": "Lua", "metadata": {"date": 1588430045, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s361935812.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361935812", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Yes\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\"\nH=reada(N)\nfor i=1,N-1 do\n\tif(H[i]>H[i+1])then\n\t\tH[i]=H[i]-1\n\t\tif(H[i]-H[i+1]>0)then print\"No\"return end\n\tend\nend\nprint\"Yes\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s615046260", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\",\"*l\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nprevious=h[1]-1\nfor i=2,n do\n    if previous<h[i] then\n        previous=h[i]-1\n    elseif previous>h[i] then\n        print(\"No\")\n        return\n    end\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1588032352, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s615046260.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s615046260", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\",\"*l\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nprevious=h[1]-1\nfor i=2,n do\n    if previous<h[i] then\n        previous=h[i]-1\n    elseif previous>h[i] then\n        print(\"No\")\n        return\n    end\nend\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 44, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820677041", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    end\nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]<0 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1587324748, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s820677041.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s820677041", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    end\nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]<0 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 65, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s779660129", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    elseif h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]<0 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1587324644, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s779660129.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s779660129", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    elseif h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nfor i=1,n-1 do\n    if h[i+1]-h[i]<0 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 63, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s543326133", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    elseif h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1587324493, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s543326133.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s543326133", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\n\nfor i=1,n-1 do\n    if h[i+1]-h[i]==-1 then\n        h[i]=h[i]-1\n    elseif h[i+1]-h[i]<=-2 then\n        print(\"No\")\n        return\n    end \nend\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 52, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s841506217", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nhmin=10^9+1\nhmax=0\nfor i=1,n do\n    hmax=math.max(hmax, h[i])\n    hmin=math.min(hmin, h[i])\nend\nif hmax-hmin>=2 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1587321736, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s841506217.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s841506217", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nhmin=10^9+1\nhmax=0\nfor i=1,n do\n    hmax=math.max(hmax, h[i])\n    hmin=math.min(hmin, h[i])\nend\nif hmax-hmin>=2 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 56, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s591935792", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nhmin=10^9+1\nhmax=0\nfor i=1,n-1 do\n    hmax=math.max(hmax, h[i])\n    hmin=math.min(hmin, h[i])\nend\nif hmax-hmin>=2 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1587321684, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s591935792.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s591935792", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\nh={}\nfor i=1,n do\n    h[i]=io.read(\"*n\")\nend\nhmin=10^9+1\nhmax=0\nfor i=1,n-1 do\n    hmax=math.max(hmax, h[i])\n    hmin=math.min(hmin, h[i])\nend\nif hmax-hmin>=2 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s594400567", "group_id": "codeNet:p02953", "input_text": "local n = io.read(\"*n\")\nlocal c = 0\nlocal f = true\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  if a < c then f = false\n  else\n    if c < a then\n      a = a - 1\n      c = a\n    end\n  end\nend\nprint(f and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1581904575, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s594400567.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594400567", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal c = 0\nlocal f = true\nfor i = 1, n do\n  local a = io.read(\"*n\")\n  if a < c then f = false\n  else\n    if c < a then\n      a = a - 1\n      c = a\n    end\n  end\nend\nprint(f and \"Yes\" or \"No\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s424722480", "group_id": "codeNet:p02953", "input_text": "n=io.read(\"*n\")\na={-2}\nfor i=1,n do\n  table.insert(a,io.read(\"*n\"))\nend\n\nfor i=2,n+1 do\n  if a[i-1]>a[i] then\n    if a[i-1]>a[i]+1 then\n      print(\"No\")\n      os.exit()\n    else\n      a[i]=a[i]+1\n    end\n  end\nend\n\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1572688316, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s424722480.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424722480", "user_id": "u535423069"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\")\na={-2}\nfor i=1,n do\n  table.insert(a,io.read(\"*n\"))\nend\n\nfor i=2,n+1 do\n  if a[i-1]>a[i] then\n    if a[i-1]>a[i]+1 then\n      print(\"No\")\n      os.exit()\n    else\n      a[i]=a[i]+1\n    end\n  end\nend\n\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s329733972", "group_id": "codeNet:p02953", "input_text": "local N = io.read(\"n\")\nlocal H = {}\nfor i=1, N do\n    H[i] = io.read(\"n\")\nend\nlocal left = H[1] - 1\nfor i=2, N do\n    if H[i] > left then\n        left = H[i] - 1\n    elseif H[i] == left then\n        left = H[i]\n    else\n        print(\"No\")\n        return\n    end\nend\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1565000765, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s329733972.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s329733972", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local N = io.read(\"n\")\nlocal H = {}\nfor i=1, N do\n    H[i] = io.read(\"n\")\nend\nlocal left = H[1] - 1\nfor i=2, N do\n    if H[i] > left then\n        left = H[i] - 1\n    elseif H[i] == left then\n        left = H[i]\n    else\n        print(\"No\")\n        return\n    end\nend\nprint(\"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 279, "cpu_time_ms": 39, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s538277051", "group_id": "codeNet:p02953", "input_text": "local n = io.read(\"*n\")\nlocal h = {}\nfor i = 1, n do\n  h[i] = io.read(\"*n\")\nend\nh[1] = h[1] - 1\nlocal ret = true\nfor i = 2, n do\n  if h[i] < h[i - 1] then\n    ret = false\n    break\n  elseif h[i - 1] < h[i] then\n    h[i] = h[i] - 1\n  end\nend\nprint(ret and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1564967137, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lua/s538277051.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538277051", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal h = {}\nfor i = 1, n do\n  h[i] = io.read(\"*n\")\nend\nh[1] = h[1] - 1\nlocal ret = true\nfor i = 2, n do\n  if h[i] < h[i - 1] then\n    ret = false\n    break\n  elseif h[i - 1] < h[i] then\n    h[i] = h[i] - 1\n  end\nend\nprint(ret and \"Yes\" or \"No\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\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\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 44, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s823484094", "group_id": "codeNet:p02983", "input_text": "local l, r = io.read(\"*n\", \"*n\")\nif 2020 < r - l then\n  print(0)\nelse\n  local ret = 2018\n  local mmi = math.min\n  for i = l, r - 1 do\n    for j = i + 1, r do\n      ret = mmi(ret, (i * j) % 2019)\n    end\n  end\n  print(ret)\nend\n", "language": "Lua", "metadata": {"date": 1600544040, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s823484094.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823484094", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l, r = io.read(\"*n\", \"*n\")\nif 2020 < r - l then\n  print(0)\nelse\n  local ret = 2018\n  local mmi = math.min\n  for i = l, r - 1 do\n    for j = i + 1, r do\n      ret = mmi(ret, (i * j) % 2019)\n    end\n  end\n  print(ret)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 114, "memory_kb": 2696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s240823367", "group_id": "codeNet:p02983", "input_text": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,(i%2019)*(j%2019)%2019)\n        end\n    end\n    print(minmod)\nend", "language": "Lua", "metadata": {"date": 1589731878, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s240823367.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240823367", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,(i%2019)*(j%2019)%2019)\n        end\n    end\n    print(minmod)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 19, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s585748689", "group_id": "codeNet:p02983", "input_text": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "language": "Lua", "metadata": {"date": 1589731639, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s585748689.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s585748689", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s635908958", "group_id": "codeNet:p02983", "input_text": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "language": "Lua", "metadata": {"date": 1589731444, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s635908958.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s635908958", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l,r=io.read(\"*n\",\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r-1 do\n        for j=i+1,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 210, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s489538976", "group_id": "codeNet:p02983", "input_text": "local l,r=io.read(\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r do\n        for j=l,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "language": "Lua", "metadata": {"date": 1589731357, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s489538976.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s489538976", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l,r=io.read(\"*n\")\n\nif l%2019+r-l>=2019 then\n    print(0)\nelse\n    local minmod=2019\n    for i=l,r do\n        for j=l,r do\n            minmod=math.min(minmod,i*j%2019)\n        end\n    end\n    print(minmod)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s972781237", "group_id": "codeNet:p02983", "input_text": "local L,R = io.read(\"n\",\"n\")\n\nlocal lim = math.min(R, L+2020)\nlocal ans = 2019\nfor i=L,lim-1 do\n  for j=i+1,lim do\n    ans = math.min(ans, i*j % 2019)\n  end\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1576124868, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s972781237.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972781237", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local L,R = io.read(\"n\",\"n\")\n\nlocal lim = math.min(R, L+2020)\nlocal ans = 2019\nfor i=L,lim-1 do\n  for j=i+1,lim do\n    ans = math.min(ans, i*j % 2019)\n  end\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 212, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s947333212", "group_id": "codeNet:p02983", "input_text": "local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max\nlocal l, r = io.read(\"*n\", \"*n\")\n\nlocal ret = 2019\nlocal imax = mmi(l + 2018, r - 1)\nfor i = l, imax do\n  local jmax = mmi(i + 1 + 2018, r)\n  for j = i + 1, jmax do\n    local cand = ((i % 2019) * (j % 2019)) % 2019\n    ret = mmi(ret, cand)\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1562548209, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lua/s947333212.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947333212", "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 l, r = io.read(\"*n\", \"*n\")\n\nlocal ret = 2019\nlocal imax = mmi(l + 2018, r - 1)\nfor i = l, imax do\n  local jmax = mmi(i + 1 + 2018, r)\n  for j = i + 1, jmax do\n    local cand = ((i % 2019) * (j % 2019)) % 2019\n    ret = mmi(ret, cand)\n  end\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s349586878", "group_id": "codeNet:p03018", "input_text": "local a = io.read(\"*l\")\nlocal b = {}\nfor i = 1, string.len(a) do\n    table.insert(b,string.sub(a,i,i))\nend\n\nlocal total = 0\n\nif #b >= 3 then\n    local numA = 0\n    local i = 0\n    while i < #b do\n        if b[i] == 'A' then\n            numA = numA + 1\n        elseif (b[i] == 'B' and b[i + 1] == 'C') then\n            total = total + numA\n            i = i + 1\n        else\n            numA = 0\n        end\n\n        i = i + 1\n    end\nend\n\nprint(total)", "language": "Lua", "metadata": {"date": 1594161954, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s349586878.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349586878", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local a = io.read(\"*l\")\nlocal b = {}\nfor i = 1, string.len(a) do\n    table.insert(b,string.sub(a,i,i))\nend\n\nlocal total = 0\n\nif #b >= 3 then\n    local numA = 0\n    local i = 0\n    while i < #b do\n        if b[i] == 'A' then\n            numA = numA + 1\n        elseif (b[i] == 'B' and b[i + 1] == 'C') then\n            total = total + numA\n            i = i + 1\n        else\n            numA = 0\n        end\n\n        i = i + 1\n    end\nend\n\nprint(total)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 91, "memory_kb": 6712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s896948577", "group_id": "codeNet:p03018", "input_text": "local a = io.read(\"*l\")\nlocal b = {}\nfor i = 1, string.len(a) do\n    table.insert(b,string.sub(a,i,i))\nend\n\nif #b < 3 then\n    return 0\nend\n\nlocal numA = 0\nlocal total = 0\nlocal i = 0\nwhile i < #b do\n    if b[i] == 'A' then\n        numA = numA + 1\n    elseif (b[i] == 'B' and b[i + 1] == 'C') then\n        total = total + numA\n        i = i + 1\n    else\n        numA = 0\n    end\n\n    i = i + 1\nend\n\nprint(total)", "language": "Lua", "metadata": {"date": 1594161862, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s896948577.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s896948577", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local a = io.read(\"*l\")\nlocal b = {}\nfor i = 1, string.len(a) do\n    table.insert(b,string.sub(a,i,i))\nend\n\nif #b < 3 then\n    return 0\nend\n\nlocal numA = 0\nlocal total = 0\nlocal i = 0\nwhile i < #b do\n    if b[i] == 'A' then\n        numA = numA + 1\n    elseif (b[i] == 'B' and b[i + 1] == 'C') then\n        total = total + numA\n        i = i + 1\n    else\n        numA = 0\n    end\n\n    i = i + 1\nend\n\nprint(total)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 91, "memory_kb": 6724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s211337442", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal ans = 0 \nlocal cur = 0\t--前两格指针\nlocal charge = false\nlocal cur1 = 0\nfor i = 1, #tbl do \n\tif i > 2 then\n\t\tcur = i - 2  \n\tend\n\tif tbl[i] == \"A\" and tbl[i+1] == \"B\" and tbl[i+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[i] = \"B\"\n\t\ttbl[i+1] = \"C\"\n\t\ttbl[i+2] = \"A\"\n\t\tcharge = true\n\telse\n\t\tcharge = false\n\tend\n\tif charge then \n\t\twhile cur > 0 do \n\t\t\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\t\t\tans = ans + 1\n\t\t\t\ttbl[cur] = \"B\"\n\t\t\t\ttbl[cur+1] = \"C\"\n\t\t\t\ttbl[cur+2] = \"A\"\n\t\t\t\tcur = cur - 2\n\t\t\telse\n\t\t\t\tcur = 0\n\t\t\tend\n\t\tend\n\tend\nend", "language": "Lua", "metadata": {"date": 1594134976, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s211337442.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s211337442", "user_id": "u353919145"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal ans = 0 \nlocal cur = 0\t--前两格指针\nlocal charge = false\nlocal cur1 = 0\nfor i = 1, #tbl do \n\tif i > 2 then\n\t\tcur = i - 2  \n\tend\n\tif tbl[i] == \"A\" and tbl[i+1] == \"B\" and tbl[i+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[i] = \"B\"\n\t\ttbl[i+1] = \"C\"\n\t\ttbl[i+2] = \"A\"\n\t\tcharge = true\n\telse\n\t\tcharge = false\n\tend\n\tif charge then \n\t\twhile cur > 0 do \n\t\t\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\t\t\tans = ans + 1\n\t\t\t\ttbl[cur] = \"B\"\n\t\t\t\ttbl[cur+1] = \"C\"\n\t\t\t\ttbl[cur+2] = \"A\"\n\t\t\t\tcur = cur - 2\n\t\t\telse\n\t\t\t\tcur = 0\n\t\t\tend\n\t\tend\n\tend\nend", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 649, "cpu_time_ms": 6, "memory_kb": 2800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s520024833", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal function A(index)\n    for i = index, #str -  2 do\n        if string.byte(tStr[i]) == string.byte(tStr[i + 1]) - 1 and string.byte(tStr[i]) == string.byte(tStr[i + 2]) - 2 then\n            tStr[i] = \"B\"\n            tStr[i + 1] = \"C\"\n            tStr[i + 2] = \"A\"\n            sum = sum + 1\n            if index > 1 then\n                A(index - 1)\n            end\n        end\n    end\n    if index <= #str -  2 then\n        A(index + 1)\n    end\nend\nA(1)\nprint(sum)", "language": "Lua", "metadata": {"date": 1594134553, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s520024833.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s520024833", "user_id": "u018679195"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal function A(index)\n    for i = index, #str -  2 do\n        if string.byte(tStr[i]) == string.byte(tStr[i + 1]) - 1 and string.byte(tStr[i]) == string.byte(tStr[i + 2]) - 2 then\n            tStr[i] = \"B\"\n            tStr[i + 1] = \"C\"\n            tStr[i + 2] = \"A\"\n            sum = sum + 1\n            if index > 1 then\n                A(index - 1)\n            end\n        end\n    end\n    if index <= #str -  2 then\n        A(index + 1)\n    end\nend\nA(1)\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 2205, "memory_kb": 6900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793901312", "group_id": "codeNet:p03018", "input_text": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\tprint_r(c)\n\t\tprint(i)\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594099859, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s793901312.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s793901312", "user_id": "u018679195"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\tprint_r(c)\n\t\tprint(i)\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 761, "cpu_time_ms": 63, "memory_kb": 6716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s386971334", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nlocal Anum = 0\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\t-- l = cur -1 \n\t\t-- while l > 0 and tbl[l] == \"A\"  do\n\t\t-- \tflag = true\n\t\t-- \tans = ans + 1\n\t\t-- \ttbl[l] = \"B\"\n\t\t-- \ttbl[l+1] = \"C\"\n\t\t-- \ttbl[l+2] = \"A\"\n\t\t-- \tl = l - 1\n\t\t-- end\n\t\t-- print(\"######\", Anum)\n\t\tif Anum > 0 then\n\t\t\tans = ans + Anum\n\t\t\ttbl[cur +1] = \"A\"\n\t\t\tif Anum > 1 then\n\t\t\t\ttbl[cur] = \"A\"\n\t\t\tend\n\t\t\tAnum = Anum - 1\n\t\tend\n\telseif tbl[cur] == \"A\" then\n\t\tif cur - 1 > 0 and tbl[cur - 1] == \"A\" then\n\t\t\tAnum = Anum + 1\n\t\telse\n\t\t\tAnum = 1\n\t\tend\n\telse\n\t\tAnum = 0\n\tend\n\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594091795, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s386971334.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s386971334", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nlocal Anum = 0\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\t-- l = cur -1 \n\t\t-- while l > 0 and tbl[l] == \"A\"  do\n\t\t-- \tflag = true\n\t\t-- \tans = ans + 1\n\t\t-- \ttbl[l] = \"B\"\n\t\t-- \ttbl[l+1] = \"C\"\n\t\t-- \ttbl[l+2] = \"A\"\n\t\t-- \tl = l - 1\n\t\t-- end\n\t\t-- print(\"######\", Anum)\n\t\tif Anum > 0 then\n\t\t\tans = ans + Anum\n\t\t\ttbl[cur +1] = \"A\"\n\t\t\tif Anum > 1 then\n\t\t\t\ttbl[cur] = \"A\"\n\t\t\tend\n\t\t\tAnum = Anum - 1\n\t\tend\n\telseif tbl[cur] == \"A\" then\n\t\tif cur - 1 > 0 and tbl[cur - 1] == \"A\" then\n\t\t\tAnum = Anum + 1\n\t\telse\n\t\t\tAnum = 1\n\t\tend\n\telse\n\t\tAnum = 0\n\tend\n\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 863, "cpu_time_ms": 84, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s615833135", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\ttbl[l] = \"B\"\n\t\t\ttbl[l+1] = \"C\"\n\t\t\ttbl[l+2] = \"A\"\n\t\t\tl = l - 1\n\t\tend\n\tend\n    cur = cur + 1\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1594091254, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s615833135.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s615833135", "user_id": "u353919145"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\ttbl[l] = \"B\"\n\t\t\ttbl[l+1] = \"C\"\n\t\t\ttbl[l+2] = \"A\"\n\t\t\tl = l - 1\n\t\tend\n\tend\n    cur = cur + 1\nend\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 2205, "memory_kb": 6844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s982134776", "group_id": "codeNet:p03018", "input_text": "local ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\ttbl[l] = \"B\"\n\t\t\ttbl[l+1] = \"C\"\n\t\t\ttbl[l+2] = \"A\"\n\t\t\tl = l - 1\n\t\tend\n\tend\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594091229, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s982134776.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s982134776", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\ttbl[l] = \"B\"\n\t\t\ttbl[l+1] = \"C\"\n\t\t\ttbl[l+2] = \"A\"\n\t\t\tl = l - 1\n\t\tend\n\tend\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 3, "memory_kb": 2668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s430491412", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\n-- local str = \"AAABCBC\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  not ((tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\") or (tStr[i + 1] == \"B\" and tStr[i + 2] == \"B\")) then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1594091047, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s430491412.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s430491412", "user_id": "u018679195"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\n-- local str = \"AAABCBC\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  not ((tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\") or (tStr[i + 1] == \"B\" and tStr[i + 2] == \"B\")) then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 81, "memory_kb": 6700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s366797352", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\n\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n        if tStr[i + 1] ~= \"A\" and not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\" and  tStr[i + 2] == \"B\") then\n            a = 0\n        end\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1594090958, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s366797352.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s366797352", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\n\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n        if tStr[i + 1] ~= \"A\" and not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\" and  tStr[i + 2] == \"B\") then\n            a = 0\n        end\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 67, "memory_kb": 6676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s392315198", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"C\"\n\t\ttbl[cur - 1] = \"B\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594090900, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s392315198.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s392315198", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\"  do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"C\"\n\t\ttbl[cur - 1] = \"B\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 88, "memory_kb": 6704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462295678", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\n-- local str = \"AAABCBC\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\")then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1594090849, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s462295678.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462295678", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\n-- local str = \"AAABCBC\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\")then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 50, "memory_kb": 6720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s482456203", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\n-- local str = \"ABCACCBABCBCAABCB\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n        if tStr[i + 1] ~= \"A\" and not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\") then\n            a = 0\n        end\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1594090709, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s482456203.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s482456203", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\n-- local str = \"ABCACCBABCBCAABCB\"\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n        if tStr[i + 1] ~= \"A\" and not (tStr[i + 1] == \"B\" and tStr[i + 2] == \"C\") then\n            a = 0\n        end\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n\n    end\nend\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 501, "cpu_time_ms": 67, "memory_kb": 6712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s216114701", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif (tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\")) or (tStr[i]  == \"B\" and (i > 1 and tStr[i - 1]  == \"B\")) then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1594090406, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s216114701.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s216114701", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif (tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\")) or (tStr[i]  == \"B\" and (i > 1 and tStr[i - 1]  == \"B\")) then\n        a = 0\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\") then\n        sum = sum + a\n        i = i + 1\n    end\nend\nprint(sum)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 61, "memory_kb": 6668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s888350199", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tif not used[cur] then\n\t\t\tans = ans + 1\n\t\t\tused[cur] = true\n\t\tend\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" and not used[l] do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tused[l] = true\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"A\"\n\t\ttbl[cur - 1] = \"C\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594090046, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s888350199.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s888350199", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tif not used[cur] then\n\t\t\tans = ans + 1\n\t\t\tused[cur] = true\n\t\tend\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" and not used[l] do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tused[l] = true\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"A\"\n\t\ttbl[cur - 1] = \"C\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 638, "cpu_time_ms": 104, "memory_kb": 12712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s381916643", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tif not used[cur] then\n\t\t\tans = ans + 1\n\t\t\tused[cur] = true\n\t\tend\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tflag = true\n\t\t\tif not used[l] then\n\t\t\t\tans = ans + 1\n\t\t\t\tused[l] = true\n\t\t\tend\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"A\"\n\t\ttbl[cur - 1] = \"C\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594089945, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s381916643.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381916643", "user_id": "u353919145"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\nlocal used = {}\nlocal cur = 1\nwhile cur <= #tbl -2 do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tif not used[cur] then\n\t\t\tans = ans + 1\n\t\t\tused[cur] = true\n\t\tend\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tflag = true\n\t\t\tif not used[l] then\n\t\t\t\tans = ans + 1\n\t\t\t\tused[l] = true\n\t\t\tend\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\t\ttbl[cur] = \"A\"\n\t\ttbl[cur - 1] = \"C\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 654, "cpu_time_ms": 104, "memory_kb": 12644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462443080", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\" ) then\n        sum = sum + a\n        i = i + 1\n    elseif tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1594089908, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s462443080.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462443080", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\" ) then\n        sum = sum + a\n        i = i + 1\n    elseif tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 73, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s081566188", "group_id": "codeNet:p03018", "input_text": "local s = io.read()\nlocal anum = 0\nlocal num = 0\nfor i=1,string.len(s)-1 do\n\tlocal a = string.sub(s, i, i)\n\tlocal b = string.sub(s, i, i+1)\n\tif a == \"A\" then\n\t\tanum = anum + 1\n\telseif  b == \"BC\" then\n\t\tnum = anum + num\n\telse\n\t\tif i > 1 and string.sub(s, i-1, i) ~= \"BC\" then\n\t\t\tanum = 0\n\t\tend\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594089860, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s081566188.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081566188", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\nlocal anum = 0\nlocal num = 0\nfor i=1,string.len(s)-1 do\n\tlocal a = string.sub(s, i, i)\n\tlocal b = string.sub(s, i, i+1)\n\tif a == \"A\" then\n\t\tanum = anum + 1\n\telseif  b == \"BC\" then\n\t\tnum = anum + num\n\telse\n\t\tif i > 1 and string.sub(s, i-1, i) ~= \"BC\" then\n\t\t\tanum = 0\n\t\tend\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 62, "memory_kb": 2748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s939382207", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\" ) then\n        sum = sum + a\n    elseif tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1594089531, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s939382207.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s939382207", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #tStr and tStr[i + 1]  == \"C\" ) then\n        sum = sum + a\n    elseif tStr[i]  == \"C\" and (i > 1 and tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 74, "memory_kb": 6720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s006076100", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #str and tStr[i + 1]  == \"C\" ) then\n        if a > 0 then\n            sum = sum + a\n        end\n    elseif tStr[i]  == \"C\" and (i > 1 and  tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)", "language": "Lua", "metadata": {"date": 1594089130, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s006076100.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s006076100", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal a = 0\nfor i = index, #str do\n    if tStr[i] == \"A\" then\n        a = a + 1\n    elseif  tStr[i]  == \"B\" and  (i + 1 <= #str and tStr[i + 1]  == \"C\" ) then\n        if a > 0 then\n            sum = sum + a\n        end\n    elseif tStr[i]  == \"C\" and (i > 1 and  tStr[i - 1]  ~= \"B\") then\n        a = 0\n    end\nend\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 52, "memory_kb": 6728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s650548731", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594088839, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s650548731.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650548731", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\tlocal flag = false\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tflag = true\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n    if flag then\n\t\ttbl[cur + 1] = \"A\"\n\tend\n    cur = cur + 1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 87, "memory_kb": 6688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s697251872", "group_id": "codeNet:p03018", "input_text": "\nlocal str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n   cur = cur+1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594088468, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s697251872.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s697251872", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur -1 \n\t\twhile l > 0 and tbl[l] == \"A\" do\n\t\t\tans = ans + 1\n\t\t\tl = l - 1\n\t\tend\n\tend\n   cur = cur+1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 79, "memory_kb": 6696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s338285468", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur\n\t\twhile l - 1 > 0 and tbl[l -1] == \"A\" do\n\t\t\tans = ans + 1\n\t\t\tl = l -1\n\t\tend\n\tend\n   cur = cur+1\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1594088240, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s338285468.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s338285468", "user_id": "u018679195"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor cur=1, string.len(str) do\n\ttbl[cur] = string.sub(str,cur,cur)\nend\n\nlocal cur = 1\nwhile cur< #tbl do\n\n\tif tbl[cur] == \"A\" and tbl[cur+1] == \"B\" and tbl[cur+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[cur] = \"B\"\n\t\ttbl[cur+1] = \"C\"\n\t\ttbl[cur+2] = \"A\"\n\t\tl = cur\n\t\twhile l - 1 > 0 and tbl[l -1] == \"A\" do\n\t\t\tans = ans + 1\n\t\t\tl = l -1\n\t\tend\n\tend\n   cur = cur+1\nend\nprint(ans)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 78, "memory_kb": 6728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s071233697", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor i=1, string.len(str) do\n\ttbl[i] = string.sub(str,i,i)\nend\n\nlocal i = 1\nwhile i< #tbl do\n\tlocal flag = false\n\tif tbl[i] == \"A\" and tbl[i+1] == \"B\" and tbl[i+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[i] = \"B\"\n\t\ttbl[i+1] = \"C\"\n\t\ttbl[i+2] = \"A\"\n\n\t\tif i>2 then\n\t\t\tflag = true\n\t\t\ti = i-2\n\t\tend\n\tend\n\tif not flag then\n\t\ti = i+1\n\tend\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1594087790, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s071233697.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s071233697", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal ans = 0\nlocal tbl = {}\nfor i=1, string.len(str) do\n\ttbl[i] = string.sub(str,i,i)\nend\n\nlocal i = 1\nwhile i< #tbl do\n\tlocal flag = false\n\tif tbl[i] == \"A\" and tbl[i+1] == \"B\" and tbl[i+2] == \"C\" then\n\t\tans = ans + 1\n\t\ttbl[i] = \"B\"\n\t\ttbl[i+1] = \"C\"\n\t\ttbl[i+2] = \"A\"\n\n\t\tif i>2 then\n\t\t\tflag = true\n\t\t\ti = i-2\n\t\tend\n\tend\n\tif not flag then\n\t\ti = i+1\n\tend\nend\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 391, "cpu_time_ms": 2205, "memory_kb": 6900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s799000391", "group_id": "codeNet:p03018", "input_text": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an - 1\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\t-- print_r(c)\n\t\t-- print(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594087484, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s799000391.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799000391", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an - 1\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\t-- print_r(c)\n\t\t-- print(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 783, "cpu_time_ms": 79, "memory_kb": 6724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s469339494", "group_id": "codeNet:p03018", "input_text": "\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an - 1\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\t-- print_r(c)\n\t\t-- print(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594087448, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s469339494.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s469339494", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an - 1\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\t-- print_r(c)\n\t\t-- print(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s191939118", "group_id": "codeNet:p03018", "input_text": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\tprint_r(c)\n\t\tprint(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594087372, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s191939118.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s191939118", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\n-- s = \"A\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nlocal lastA = 0\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = lastA + 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = \"A\"\n\t\t\tlastA = an\n\t\telse\n\t\t\ti = k\n\t\t\tlastA = 0\n\t\tend\n\t\tprint_r(c)\n\t\tprint(i)\n\telse\n\t\ti = i + 1\n\t\tlastA = 0\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 62, "memory_kb": 6668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s222719940", "group_id": "codeNet:p03018", "input_text": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal function A(index)\n    for i = index, #str -  2 do\n        local str1 = \"\"\n        for i = index, #tStr do\n            str1 = str1 .. tStr[i]\n        end\n        if string.byte(tStr[i]) == string.byte(tStr[i + 1]) - 1 and string.byte(tStr[i]) == string.byte(tStr[i + 2]) - 2 then\n            tStr[i] = \"B\"\n            tStr[i + 1] = \"C\"\n            tStr[i + 2] = \"A\"\n            sum = sum + 1\n            if index > 1 then\n                A(index - 1)\n            end\n        end\n    end\n    if index <= #str -  2 then\n        A(index + 1)\n    end\nend\nA(1)\nprint(sum)", "language": "Lua", "metadata": {"date": 1594086912, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s222719940.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s222719940", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local str = io.read()\nlocal index = 1\nlocal tStr = {}\nfor i = 1, #str do\n    tStr[i] = string.sub(str, i, i)\nend\nlocal sum = 0\nlocal function A(index)\n    for i = index, #str -  2 do\n        local str1 = \"\"\n        for i = index, #tStr do\n            str1 = str1 .. tStr[i]\n        end\n        if string.byte(tStr[i]) == string.byte(tStr[i + 1]) - 1 and string.byte(tStr[i]) == string.byte(tStr[i + 2]) - 2 then\n            tStr[i] = \"B\"\n            tStr[i + 1] = \"C\"\n            tStr[i + 2] = \"A\"\n            sum = sum + 1\n            if index > 1 then\n                A(index - 1)\n            end\n        end\n    end\n    if index <= #str -  2 then\n        A(index + 1)\n    end\nend\nA(1)\nprint(sum)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 698, "cpu_time_ms": 2206, "memory_kb": 17048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s631264597", "group_id": "codeNet:p03018", "input_text": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = 'A'\n\t\telse\n\t\t\ti = k\n\t\tend\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594086435, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s631264597.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s631264597", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\tlocal an = 1\n\t\tlocal x = i\n\t\tfor j = i + 1, #c - 2 do\n\t\t\tif c[j] ~= \"A\" then\n\t\t\t\tbreak\n\t\t\tend\n\t\t\tan = an + 1\n\t\t\tx = j\n\t\tend\n\t\tlocal bcn = 0\n\t\tlocal k = x + 1\n\t\twhile k < #c do\n\t\t\tif c[k] == \"B\" and c[k+1] == \"C\" then\n\t\t\t\tbcn = bcn + 1\n\t\t\t\tk = k + 2\n\t\t\telse\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\t-- print(222, i, x, k, an, bcn, c[i], c[i+1], c[i+2])\n\t\tnum = num + an * bcn\n\t\tif bcn >= 1 then\n\t\t\ti = k - 1\n\t\t\tc[i] = 'A'\n\t\telse\n\t\t\ti = k\n\t\tend\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 675, "cpu_time_ms": 81, "memory_kb": 6708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s887179765", "group_id": "codeNet:p03018", "input_text": "local s = io.read()\n\nlocal i = 1\nlocal numa = 0\nlocal all = 0\nwhile(true) do \n\tif string.byte(s, i) == 65 then\n\t\ti = i + 1\n\t\tnuma = numa + 1\n\telseif string.byte(s, i) == 66 and string.byte(s, i + 1) == 67 then\n\t\ti = i + 2\n\t\tall = all + numa\n\telse\n\t\ti = i + 1\n\t\tnuma = 0\n\tend\n\tif i > string.len(s) + 1 then\n\t\tbreak\n\tend\nend\nprint(all)", "language": "Lua", "metadata": {"date": 1594085845, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s887179765.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s887179765", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\n\nlocal i = 1\nlocal numa = 0\nlocal all = 0\nwhile(true) do \n\tif string.byte(s, i) == 65 then\n\t\ti = i + 1\n\t\tnuma = numa + 1\n\telseif string.byte(s, i) == 66 and string.byte(s, i + 1) == 67 then\n\t\ti = i + 2\n\t\tall = all + numa\n\telse\n\t\ti = i + 1\n\t\tnuma = 0\n\tend\n\tif i > string.len(s) + 1 then\n\t\tbreak\n\tend\nend\nprint(all)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 74, "memory_kb": 2728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s731556222", "group_id": "codeNet:p03018", "input_text": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\t-- print(222, i, c[i], c[i+1], c[i+2])\n\t\tif c[i+1] == \"B\" and c[i+2] == \"C\" then\n\t\t\tc[i] = \"B\"\n\t\t\tc[i+1] = \"C\"\n\t\t\tc[i+2] = \"A\"\n\t\t\ti = i - 1\n\t\t\tif i <= 0 then\n\t\t\t\ti = 1\n\t\t\tend\n\t\t\tnum = num + 1\n\t\telse\n\t\t\ti = i + 1\n\t\tend\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "language": "Lua", "metadata": {"date": 1594085126, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s731556222.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s731556222", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nlocal s = io.read()\n-- s = \"ABCABC\"\n-- s = \"ABCACCBABCBCAABCB\"\nlocal c = {}\nfor i = 1, #s do\n\tc[i] = string.sub(s, i, i)\nend\n-- print_r(c)\n\nlocal num = 0\nlocal i = 1\nwhile i <= #c - 2 do\n\tif c[i] == \"A\" then\n\t\t-- print(222, i, c[i], c[i+1], c[i+2])\n\t\tif c[i+1] == \"B\" and c[i+2] == \"C\" then\n\t\t\tc[i] = \"B\"\n\t\t\tc[i+1] = \"C\"\n\t\t\tc[i+2] = \"A\"\n\t\t\ti = i - 1\n\t\t\tif i <= 0 then\n\t\t\t\ti = 1\n\t\t\tend\n\t\t\tnum = num + 1\n\t\telse\n\t\t\ti = i + 1\n\t\tend\n\telse\n\t\ti = i + 1\n\tend\nend\nprint(num)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 2206, "memory_kb": 6840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s195799845", "group_id": "codeNet:p03018", "input_text": "local s = io.read()\n\nlocal i = 1\nlocal counts = {}\nlocal all = 0\nwhile(true) do \n\tif string.byte(s, i) == 65 then\n\t\ti = i + 1\n\t\ttable.insert(counts, 0)\n\telseif string.byte(s, i) == 66 and string.byte(s, i + 1) == 67 then\n\t\ti = i + 2\n\t\tfor t, v in ipairs(counts) do \n\t\t\tcounts[t] = counts[t] + 1 \n\t\tend\n\telse\n\t\ti = i + 1\n\t\tfor _, v in ipairs(counts) do \n\t\t\tall = all + v\n\t\tend\n\t\tcounts = {}\n\tend\n\tif i > string.len(s) + 1 then\n\t\tbreak\n\tend\nend\nprint(all)", "language": "Lua", "metadata": {"date": 1594085065, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s195799845.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s195799845", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\n\nlocal i = 1\nlocal counts = {}\nlocal all = 0\nwhile(true) do \n\tif string.byte(s, i) == 65 then\n\t\ti = i + 1\n\t\ttable.insert(counts, 0)\n\telseif string.byte(s, i) == 66 and string.byte(s, i + 1) == 67 then\n\t\ti = i + 2\n\t\tfor t, v in ipairs(counts) do \n\t\t\tcounts[t] = counts[t] + 1 \n\t\tend\n\telse\n\t\ti = i + 1\n\t\tfor _, v in ipairs(counts) do \n\t\t\tall = all + v\n\t\tend\n\t\tcounts = {}\n\tend\n\tif i > string.len(s) + 1 then\n\t\tbreak\n\tend\nend\nprint(all)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 2205, "memory_kb": 6544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s788925835", "group_id": "codeNet:p03018", "input_text": "local s=io.read():gsub(\"BC\",\"D\")\nlocal counter=0\nlocal answer=0\nfor i=1,#s do\n    if s:byte(i)==65 then\n        counter=counter+1\n    elseif s:byte(i)==68 then\n        answer=answer+counter\n    else\n        counter=0\n    end\nend\nprint(answer)", "language": "Lua", "metadata": {"date": 1593960837, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s788925835.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788925835", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read():gsub(\"BC\",\"D\")\nlocal counter=0\nlocal answer=0\nfor i=1,#s do\n    if s:byte(i)==65 then\n        counter=counter+1\n    elseif s:byte(i)==68 then\n        answer=answer+counter\n    else\n        counter=0\n    end\nend\nprint(answer)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 3008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s669236728", "group_id": "codeNet:p03018", "input_text": "local s=io.read():gsub(\"BC\",\"D\")\nlocal counter=0\nlocal answer=0\nfor i=1,#s do\n    if s:byte(i)==65 then\n        counter=counter+1\n    elseif s:byte(i)==68 then\n        answer=answer+counter\n    else\n        counter=0\n    end\nend\nprint(answer)", "language": "Lua", "metadata": {"date": 1593960822, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s669236728.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669236728", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s=io.read():gsub(\"BC\",\"D\")\nlocal counter=0\nlocal answer=0\nfor i=1,#s do\n    if s:byte(i)==65 then\n        counter=counter+1\n    elseif s:byte(i)==68 then\n        answer=answer+counter\n    else\n        counter=0\n    end\nend\nprint(answer)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 53, "memory_kb": 3000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s003815081", "group_id": "codeNet:p03018", "input_text": "local s = io.read()\nlocal ret = 0\nlocal cura = 0\nlocal n = #s\nlocal i = 1\nwhile i <= n do\n  local ss = s:sub(i, i)\n  if ss == \"A\" then\n    cura = cura + 1\n    i = i + 1\n  elseif ss == \"B\" then\n    if i < n and s:sub(i + 1, i + 1) == \"C\" then\n      ret = ret + cura\n      i = i + 2\n    else\n      cura = 0\n      i = i + 1\n    end\n  else\n    cura = 0\n    i = i + 1\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1589938914, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s003815081.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s003815081", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local s = io.read()\nlocal ret = 0\nlocal cura = 0\nlocal n = #s\nlocal i = 1\nwhile i <= n do\n  local ss = s:sub(i, i)\n  if ss == \"A\" then\n    cura = cura + 1\n    i = i + 1\n  elseif ss == \"B\" then\n    if i < n and s:sub(i + 1, i + 1) == \"C\" then\n      ret = ret + cura\n      i = i + 2\n    else\n      cura = 0\n      i = i + 1\n    end\n  else\n    cura = 0\n    i = i + 1\n  end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 384, "cpu_time_ms": 62, "memory_kb": 1016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s823683735", "group_id": "codeNet:p03018", "input_text": "--[[\nABCACCBABCBCAABCB\n[1] ABCACCBABCBCABCAB\n[2] ABCACCBABCBCBCAAB\n[5] ABCACCBBCBCBCAAAB\n[6] BCAACCBBCBCBCAAAB\n\nAAABCBC\n\nBCBCAAA\n\n]]\nlocal s = io.read()\nlocal n = #s\nlocal sub = \"\"\nlocal state = 1\nlocal alen = 0\nlocal ret = 0\nfor i = 1, n do\n  sub = s:sub(i, i)\n  if state == 1 then\n    if sub == \"A\" then\n      alen = alen + 1\n    elseif sub == \"B\" then\n      state = 2\n    else\n      alen = 0\n    end\n  elseif state == 2 then\n    if sub == \"C\" then\n      ret = ret + alen\n    elseif sub == \"A\" then\n      alen = 1\n    else\n      alen = 0\n    end\n    state = 1\n  end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1565659562, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lua/s823683735.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823683735", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "--[[\nABCACCBABCBCAABCB\n[1] ABCACCBABCBCABCAB\n[2] ABCACCBABCBCBCAAB\n[5] ABCACCBBCBCBCAAAB\n[6] BCAACCBBCBCBCAAAB\n\nAAABCBC\n\nBCBCAAA\n\n]]\nlocal s = io.read()\nlocal n = #s\nlocal sub = \"\"\nlocal state = 1\nlocal alen = 0\nlocal ret = 0\nfor i = 1, n do\n  sub = s:sub(i, i)\n  if state == 1 then\n    if sub == \"A\" then\n      alen = alen + 1\n    elseif sub == \"B\" then\n      state = 2\n    else\n      alen = 0\n    end\n  elseif state == 2 then\n    if sub == \"C\" then\n      ret = ret + alen\n    elseif sub == \"A\" then\n      alen = 1\n    else\n      alen = 0\n    end\n    state = 1\n  end\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 583, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s380861864", "group_id": "codeNet:p03053", "input_text": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal a={}\nlocal dist={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    dist[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n        dist[i][j]=-1\n    end\nend\n\nlocal que={}\nfor i=1,h do\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            table.insert(que,{i,j})\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nlocal l=1\nwhile que[l] do\n    local i=que[l][1]\n    local j=que[l][2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni] and dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            table.insert(que,{ni,nj})\n        end \n    end\n    l=l+1\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595473145, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s380861864.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380861864", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local h,w=io.read(\"n\",\"n\",\"l\")\nlocal a={}\nlocal dist={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    dist[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n        dist[i][j]=-1\n    end\nend\n\nlocal que={}\nfor i=1,h do\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            table.insert(que,{i,j})\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nlocal l=1\nwhile que[l] do\n    local i=que[l][1]\n    local j=que[l][2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni] and dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            table.insert(que,{ni,nj})\n        end \n    end\n    l=l+1\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 286, "memory_kb": 89372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s668460127", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni] and dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(que,{ni,nj})\n        end \n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595472250, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s668460127.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s668460127", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni] and dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(que,{ni,nj})\n        end \n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1622, "cpu_time_ms": 1104, "memory_kb": 89548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s715566361", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(que,{ni,nj})\n        end \n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595472198, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s715566361.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s715566361", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if dist[ni][nj] and dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(que,{ni,nj})\n        end \n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1609, "cpu_time_ms": 166, "memory_kb": 89344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s118766654", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(que,{ni,nj})\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471920, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s118766654.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s118766654", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal que=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(que,{i,j})\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local pop=List.popleft(que)\n    if not pop then\n        break\n    end\n    local i=pop[1]\n    local j=pop[2]\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(que,{ni,nj})\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1678, "cpu_time_ms": 1104, "memory_kb": 89340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s567977296", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471662, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s567977296.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s567977296", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1777, "cpu_time_ms": 1104, "memory_kb": 36280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s609224692", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471630, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s609224692.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s609224692", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1792, "cpu_time_ms": 107, "memory_kb": 44488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s912858318", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471592, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s912858318.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s912858318", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nfor i=1,h do\n    for j=1,w do\n        dist[i][j]=-1\n    end\nend\n\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1777, "cpu_time_ms": 24, "memory_kb": 11024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s974544243", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n            goto continue\n        end\n        if dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(iue,ni)\n            List.pushright(jue,nj)\n        end\n        ::continue::\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471350, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s974544243.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s974544243", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n            goto continue\n        end\n        if dist[ni][nj]==-1 then\n            dist[ni][nj]=dist[i][j]+1\n            List.pushright(iue,ni)\n            List.pushright(jue,nj)\n        end\n        ::continue::\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1764, "cpu_time_ms": 1104, "memory_kb": 36140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s160297901", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471294, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s160297901.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s160297901", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1751, "cpu_time_ms": 1104, "memory_kb": 36040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s375285190", "group_id": "codeNet:p03053", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "language": "Lua", "metadata": {"date": 1595471207, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s375285190.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s375285190", "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 a={}\nfor i=1,h do\n    local input=io.read()\n    a[i]={}\n    for j=1,w do\n        a[i][j]=input:byte(j)\n    end\nend\n\nlocal dist={}\nlocal iue=List.new()\nlocal jue=List.new()\nfor i=1,h do\n    dist[i]={}\n    for j=1,w do\n        if a[i][j]==35 then\n            dist[i][j]=0\n            List.pushright(iue,i)\n            List.pushright(jue,j)\n        else\n            dist[i][j]=-1\n        end\n    end\nend\n\nlocal di={1,0,-1,0}\nlocal dj={0,1,0,-1}\nwhile true do\n    local i=List.popleft(iue)\n    if not i then\n        break\n    end\n    local j=List.popleft(jue)\n    for k=1,4 do\n        local ni=i+di[k]\n        local nj=j+dj[k]\n        if ni<1 or ni>h or nj<1 or nj>w then\n        else\n            if dist[ni][nj]==-1 then\n                dist[ni][nj]=dist[i][j]+1\n                List.pushright(iue,ni)\n                List.pushright(jue,nj)\n            end \n        end\n    end\nend\n\nlocal max=0\nfor i=1,h do\n    for j=1,w do\n        max=math.max(max,dist[i][j])\n    end\nend\nprint(max)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1751, "cpu_time_ms": 1104, "memory_kb": 83428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s144912647", "group_id": "codeNet:p03053", "input_text": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal tasks = {}\nlocal len = {}\nfor i = 1, h do\n  s = io.read()\n  for j = 1, w do\n    local idx = (i - 1) * w + j\n    if s:sub(j, j) == \"#\" then\n      len[idx] = 0\n      table.insert(tasks, idx)\n    else\n      len[idx] = 1000000007\n    end\n  end\nend\nlocal done = 0\n\nlocal function walk(src, dst)\n  if len[src] + 1 < len[dst] then\n    len[dst] = len[src] + 1\n    table.insert(tasks, dst)\n  end\nend\n\nfor i = 1, h * w do\n  local idx = tasks[i]\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\nend\nlocal ans = len[1]\nlocal mma = math.max\nfor i = 2, h * w do\n  ans = mma(ans, len[i])\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1594129361, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s144912647.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144912647", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal tasks = {}\nlocal len = {}\nfor i = 1, h do\n  s = io.read()\n  for j = 1, w do\n    local idx = (i - 1) * w + j\n    if s:sub(j, j) == \"#\" then\n      len[idx] = 0\n      table.insert(tasks, idx)\n    else\n      len[idx] = 1000000007\n    end\n  end\nend\nlocal done = 0\n\nlocal function walk(src, dst)\n  if len[src] + 1 < len[dst] then\n    len[dst] = len[src] + 1\n    table.insert(tasks, dst)\n  end\nend\n\nfor i = 1, h * w do\n  local idx = tasks[i]\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\nend\nlocal ans = len[1]\nlocal mma = math.max\nfor i = 2, h * w do\n  ans = mma(ans, len[i])\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 795, "cpu_time_ms": 699, "memory_kb": 35932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s146828393", "group_id": "codeNet:p03053", "input_text": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal tasks = {}\nlocal len = {}\nfor i = 1, h do\n  s = io.read()\n  for j = 1, w do\n    local idx = (i - 1) * w + j\n    if s:sub(j, j) == \"#\" then\n      len[idx] = 0\n      table.insert(tasks, idx)\n    else\n      len[idx] = 1000000007\n    end\n  end\nend\nlocal done = 0\n\nlocal function walk(src, dst)\n  if len[src] + 1 < len[dst] then\n    len[dst] = len[src] + 1\n    table.insert(tasks, dst)\n  end\nend\n\nwhile done < #tasks do\n  done = done + 1\n  local idx = tasks[done]\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\nend\nlocal ans = len[1]\nfor i = 2, h * w do\n  ans = math.max(ans, len[i])\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1594129242, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s146828393.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146828393", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal tasks = {}\nlocal len = {}\nfor i = 1, h do\n  s = io.read()\n  for j = 1, w do\n    local idx = (i - 1) * w + j\n    if s:sub(j, j) == \"#\" then\n      len[idx] = 0\n      table.insert(tasks, idx)\n    else\n      len[idx] = 1000000007\n    end\n  end\nend\nlocal done = 0\n\nlocal function walk(src, dst)\n  if len[src] + 1 < len[dst] then\n    len[dst] = len[src] + 1\n    table.insert(tasks, dst)\n  end\nend\n\nwhile done < #tasks do\n  done = done + 1\n  local idx = tasks[done]\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\nend\nlocal ans = len[1]\nfor i = 2, h * w do\n  ans = math.max(ans, len[i])\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 803, "cpu_time_ms": 810, "memory_kb": 35896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s719069609", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nlocal distance = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\n    distance[i] = {}\n    local grid_i, distance_i = grid[i], distance[i]\n    for j=1, W do\n        distance_i[j] = grid_i[j] == '#' and 0 or 2001\n    end\nend\nlocal math_min = math.min\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=2, W do\n        distance_i[j] = math_min(distance_i[j], distance_i[j-1] + 1)\n    end\nend\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=W-1, 1, -1 do\n        distance_i[j] = math_min(distance_i[j], distance_i[j+1] + 1)\n    end\nend\nfor i=2, H do\n    local distance_i = distance[i]\n    local distance_im1 = distance[i-1]\n    for j=1, W do\n        distance_i[j] = math_min(distance_i[j], distance_im1[j] + 1)\n    end\nend\nfor i=H-1, 1, -1 do\n    local distance_i = distance[i]\n    local distance_ip1 = distance[i+1]\n    for j=1, W do\n        distance_i[j] = math_min(distance_i[j], distance_ip1[j] + 1)\n    end\nend\nlocal ans = 0\nlocal math_max = math.max\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=1, W do\n        ans = math_max(ans, distance_i[j])\n    end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1557089736, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s719069609.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719069609", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nlocal distance = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\n    distance[i] = {}\n    local grid_i, distance_i = grid[i], distance[i]\n    for j=1, W do\n        distance_i[j] = grid_i[j] == '#' and 0 or 2001\n    end\nend\nlocal math_min = math.min\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=2, W do\n        distance_i[j] = math_min(distance_i[j], distance_i[j-1] + 1)\n    end\nend\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=W-1, 1, -1 do\n        distance_i[j] = math_min(distance_i[j], distance_i[j+1] + 1)\n    end\nend\nfor i=2, H do\n    local distance_i = distance[i]\n    local distance_im1 = distance[i-1]\n    for j=1, W do\n        distance_i[j] = math_min(distance_i[j], distance_im1[j] + 1)\n    end\nend\nfor i=H-1, 1, -1 do\n    local distance_i = distance[i]\n    local distance_ip1 = distance[i+1]\n    for j=1, W do\n        distance_i[j] = math_min(distance_i[j], distance_ip1[j] + 1)\n    end\nend\nlocal ans = 0\nlocal math_max = math.max\nfor i=1, H do\n    local distance_i = distance[i]\n    for j=1, W do\n        ans = math_max(ans, distance_i[j])\n    end\nend\nprint(ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1313, "cpu_time_ms": 647, "memory_kb": 32760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s367634111", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nlocal function List_new()\n    local tbl = {}\n    local first = 1\n    local last = 0\n    local function count()\n        return last - first + 1\n    end\n    local function pushright(value)\n        local new_last = last + 1\n        last = new_last\n        tbl[last] = value\n    end\n    local function popleft(value)\n        --if first > last then error(\"list is empty\") end\n        local value = tbl[first]\n        tbl[first] = nil\n        first = first + 1\n        return value\n    end\n    return {pushright, popleft, count}\nend\nlocal pushright, popleft, count = 1, 2, 3\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal ans = 0\nlocal blacks = List_new()\nlocal blacks_used = {}\nfor i=1, 1000*1000+1000 do\n    blacks_used[i] = false\nend\nlocal function not_blacks_used(i, j)\n    local k = i*1000+j\n    local used = blacks_used[k]\n    blacks_used[k] = true\n    return not used\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks[pushright](i)\n                blacks[pushright](j)\n            end\n        end\n    end\nend\nlocal dx = {-1, 1, 0, 0}\nlocal dy = {0, 0, -1, 1}\n\nlocal next = List_new()\nwhile blacks[count]() > 0 do\n    while blacks[count]() > 0 do\n        local i = blacks[popleft]()\n        local j = blacks[popleft]()\n        for k=1, 4 do\n            local x, y = i + dx[k], j + dy[k]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next[pushright](x)\n                    next[pushright](y)\n                end\n            end\n        end\n    end\n    ans = ans + 1\n    blacks, next = next, blacks\nend\nprint(ans-1)", "language": "Lua", "metadata": {"date": 1557088193, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s367634111.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s367634111", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nlocal function List_new()\n    local tbl = {}\n    local first = 1\n    local last = 0\n    local function count()\n        return last - first + 1\n    end\n    local function pushright(value)\n        local new_last = last + 1\n        last = new_last\n        tbl[last] = value\n    end\n    local function popleft(value)\n        --if first > last then error(\"list is empty\") end\n        local value = tbl[first]\n        tbl[first] = nil\n        first = first + 1\n        return value\n    end\n    return {pushright, popleft, count}\nend\nlocal pushright, popleft, count = 1, 2, 3\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal ans = 0\nlocal blacks = List_new()\nlocal blacks_used = {}\nfor i=1, 1000*1000+1000 do\n    blacks_used[i] = false\nend\nlocal function not_blacks_used(i, j)\n    local k = i*1000+j\n    local used = blacks_used[k]\n    blacks_used[k] = true\n    return not used\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks[pushright](i)\n                blacks[pushright](j)\n            end\n        end\n    end\nend\nlocal dx = {-1, 1, 0, 0}\nlocal dy = {0, 0, -1, 1}\n\nlocal next = List_new()\nwhile blacks[count]() > 0 do\n    while blacks[count]() > 0 do\n        local i = blacks[popleft]()\n        local j = blacks[popleft]()\n        for k=1, 4 do\n            local x, y = i + dx[k], j + dy[k]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next[pushright](x)\n                    next[pushright](y)\n                end\n            end\n        end\n    end\n    ans = ans + 1\n    blacks, next = next, blacks\nend\nprint(ans-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2036, "cpu_time_ms": 1058, "memory_kb": 81388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s379517987", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nlocal tuples = {{-1,0},{1,0},{0,-1},{0,1}}\nlocal next = List.new()\nwhile blacks:count() > 0 do\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        for _, tuple in ipairs(tuples) do\n            local x,y = i + tuple[1], j + tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks, next = next, blacks\nend\nprint(count-1)", "language": "Lua", "metadata": {"date": 1557087393, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s379517987.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s379517987", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nlocal tuples = {{-1,0},{1,0},{0,-1},{0,1}}\nlocal next = List.new()\nwhile blacks:count() > 0 do\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        for _, tuple in ipairs(tuples) do\n            local x,y = i + tuple[1], j + tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks, next = next, blacks\nend\nprint(count-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2225, "cpu_time_ms": 1065, "memory_kb": 158200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s315841909", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nlocal tuples = {{-1,0},{1,0},{0,-1},{0,1}}\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        for _, tuple in ipairs(tuples) do\n            local x,y = i + tuple[1], j + tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "language": "Lua", "metadata": {"date": 1557061125, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s315841909.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s315841909", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nlocal tuples = {{-1,0},{1,0},{0,-1},{0,1}}\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        for _, tuple in ipairs(tuples) do\n            local x,y = i + tuple[1], j + tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2465, "cpu_time_ms": 326, "memory_kb": 87128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s782598610", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nlocal function List_new()\n    local tbl = {}\n    local first = 1\n    local last = 0\n    local function count()\n        return last - first + 1\n    end\n    local function pushright(value)\n        local new_last = last + 1\n        last = new_last\n        tbl[last] = value\n    end\n    local function popleft(value)\n        --if first > last then error(\"list is empty\") end\n        local value = tbl[first]\n        tbl[first] = nil\n        first = first + 1\n        return value\n    end\n    return pushright, popleft, count\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal loops = 0\nlocal count = 0\nlocal blacks_pushright, blacks_popleft, blacks_count = List_new()\nlocal blacks_used = {}\nfor i=1, 1000*1000 + 1000 do\n    blacks_used[i] = false\nend\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        loops = loops + 1\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks_pushright({i, j})\n            end\n        end\n    end\nend\n\nlocal cur_count = 0\nwhile blacks_count() > 0 do\n    for bc=blacks_count(),1,-1 do\n        local t = blacks_popleft()\n        local i, j = t[1], t[2]\n        for dyx=0,3 do\n            local y01, x01 = dyx/2 - dyx/2%1, dyx%2\n            local dy = y01 * (-1 + 2 * x01)\n            local dx = (1 - y01) * (-1 + 2 * x01)\n            --print(dyx,y01,x01,dy,dx)\n            local x = i + dx\n            local y = j + dy\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    blacks_pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\nend\nprint(count-1)", "language": "Lua", "metadata": {"date": 1557061016, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s782598610.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782598610", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nlocal function List_new()\n    local tbl = {}\n    local first = 1\n    local last = 0\n    local function count()\n        return last - first + 1\n    end\n    local function pushright(value)\n        local new_last = last + 1\n        last = new_last\n        tbl[last] = value\n    end\n    local function popleft(value)\n        --if first > last then error(\"list is empty\") end\n        local value = tbl[first]\n        tbl[first] = nil\n        first = first + 1\n        return value\n    end\n    return pushright, popleft, count\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal loops = 0\nlocal count = 0\nlocal blacks_pushright, blacks_popleft, blacks_count = List_new()\nlocal blacks_used = {}\nfor i=1, 1000*1000 + 1000 do\n    blacks_used[i] = false\nend\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        loops = loops + 1\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks_pushright({i, j})\n            end\n        end\n    end\nend\n\nlocal cur_count = 0\nwhile blacks_count() > 0 do\n    for bc=blacks_count(),1,-1 do\n        local t = blacks_popleft()\n        local i, j = t[1], t[2]\n        for dyx=0,3 do\n            local y01, x01 = dyx/2 - dyx/2%1, dyx%2\n            local dy = y01 * (-1 + 2 * x01)\n            local dx = (1 - y01) * (-1 + 2 * x01)\n            --print(dyx,y01,x01,dy,dx)\n            local x = i + dx\n            local y = j + dy\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    blacks_pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\nend\nprint(count-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2144, "cpu_time_ms": 528, "memory_kb": 87012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s611384224", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        local tuples = {{i-1,j},{i+1,j},{i,j-1},{i,j+1}}\n        for _, tuple in ipairs(tuples) do\n            local x,y = tuple[1], tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "language": "Lua", "metadata": {"date": 1557030085, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s611384224.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s611384224", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        local tuples = {{i-1,j},{i+1,j},{i,j-1},{i,j+1}}\n        for _, tuple in ipairs(tuples) do\n            local x,y = tuple[1], tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2471, "cpu_time_ms": 1063, "memory_kb": 217512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s175330913", "group_id": "codeNet:p03053", "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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        local tuples = {{i-1,j},{i+1,j},{i,j-1},{i,j+1}}\n        for _, tuple in ipairs(tuples) do\n            local x,y = tuple[1], tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "language": "Lua", "metadata": {"date": 1557030050, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s175330913.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s175330913", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n-- http://www.lua.org/pil/11.4.html\nList = {}\nfunction List.new()\n  return setmetatable({first = 0, last = -1}, {__index = List})\nend\n\nfunction List:pushleft(value)\n  local first = self.first - 1\n  self.first = first\n  self[first] = value\nend\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\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\nfunction List:count()\n    return self.last - self.first + 1\nend\n\ndo\n    local a = List.new()\n    assert(a:count() == 0)\n    a:pushleft(1)\n    assert(a:count() == 1)\n    a:pushright(1)\n    assert(a:count() == 2)\n    a:popleft()\n    assert(a:count() == 1)\n    a:popright()\n    assert(a:count() == 0)\n    a = nil\nend\n\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks = List.new()\nlocal blacks_used = {}\nlocal function not_blacks_used(i, j)\n    if not blacks_used[i*1000+j] then\n        blacks_used[i*1000+j] = true\n        return true\n    end\n    return false\nend\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            if not_blacks_used(i, j) then\n                blacks:pushright({i, j})\n            end\n        end\n    end\nend\nwhile blacks:count() > 0 do\n    local next = List.new()\n    while blacks:count() > 0 do\n        local t = blacks:popleft()\n        local i, j = t[1], t[2]\n        local tuples = {{i-1,j},{i+1,j},{i,j-1},{i,j+1}}\n        for _, tuple in ipairs(tuples) do\n            local x,y = tuple[1], tuple[2]\n            if x >= 1 and x <= H and y >= 1 and y <= W then\n                if not_blacks_used(x, y) then\n                    next:pushright({x, y})\n                end\n            end\n        end\n    end\n    count = count + 1\n    blacks = next\nend\nprint(count-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2471, "cpu_time_ms": 1071, "memory_kb": 262904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710400884", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nlocal distance = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\n    distance[i] = {}\n    for j=1, W do\n        distance[i][j] = 2001\n    end\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal blacks = {}\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            table.insert(blacks, {i, j})\n        end\n    end\nend\nfor _, t in ipairs(blacks) do\n    local i, j = t[1], t[2]\n    distance[i][j] = 0\nend\nlocal function dfs(d, i, j)\n    d = d + 1\n    local x, y\n    x, y = i-1, j\n    if x >= 1 and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i+1, j\n    if x <= H and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i, j-1\n    if y >= 1 and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i, j+1\n    if y <= W and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\nend\nfor _, t in ipairs(blacks) do\n    local i, j = t[1], t[2]\n    dfs(0, i, j)\nend\nlocal dmax = 0\nfor i=1, H do\n    for j=1, W do\n        dmax = math.max(distance[i][j], dmax)\n    end\nend\nprint(dmax)", "language": "Lua", "metadata": {"date": 1557022317, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s710400884.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s710400884", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nlocal distance = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\n    distance[i] = {}\n    for j=1, W do\n        distance[i][j] = 2001\n    end\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal blacks = {}\nfor i=1, H do\n    for j=1, W do\n        local c = grid[i][j]\n        if c == '#' then\n            table.insert(blacks, {i, j})\n        end\n    end\nend\nfor _, t in ipairs(blacks) do\n    local i, j = t[1], t[2]\n    distance[i][j] = 0\nend\nlocal function dfs(d, i, j)\n    d = d + 1\n    local x, y\n    x, y = i-1, j\n    if x >= 1 and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i+1, j\n    if x <= H and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i, j-1\n    if y >= 1 and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\n    x, y = i, j+1\n    if y <= W and distance[x][y] > d then\n        distance[x][y] = d\n        dfs(d, x, y)\n    end\nend\nfor _, t in ipairs(blacks) do\n    local i, j = t[1], t[2]\n    dfs(0, i, j)\nend\nlocal dmax = 0\nfor i=1, H do\n    for j=1, W do\n        dmax = math.max(distance[i][j], dmax)\n    end\nend\nprint(dmax)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1057, "memory_kb": 86896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s638237245", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks_used = {}\nwhile true do\n    local all_black = true\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n            end\n            if c == '#' then\n                if not blacks_used[i*1000+j] then\n                    table.insert(blacks, {i, j})\n                    blacks_used[i*1000+j] = true\n                end\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count, #blacks)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "language": "Lua", "metadata": {"date": 1557019913, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s638237245.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s638237245", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks_used = {}\nwhile true do\n    local all_black = true\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n            end\n            if c == '#' then\n                if not blacks_used[i*1000+j] then\n                    table.insert(blacks, {i, j})\n                    blacks_used[i*1000+j] = true\n                end\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count, #blacks)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1375, "cpu_time_ms": 1057, "memory_kb": 87000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s861653235", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks_used = {}\nwhile true do\n    local all_black = true\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n            if c == '#' then\n                if not blacks_used[i*1000+j] then\n                    table.insert(blacks, {i, j})\n                    blacks_used[i*1000+j] = true\n                end\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "language": "Lua", "metadata": {"date": 1557019724, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s861653235.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s861653235", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nlocal blacks_used = {}\nwhile true do\n    local all_black = true\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n            if c == '#' then\n                if not blacks_used[i*1000+j] then\n                    table.insert(blacks, {i, j})\n                    blacks_used[i*1000+j] = true\n                end\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1388, "cpu_time_ms": 1057, "memory_kb": 87188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s360883883", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "language": "Lua", "metadata": {"date": 1557019514, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s360883883.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s360883883", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"*n\", \"*n\", \"*l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"*l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1335, "cpu_time_ms": 1067, "memory_kb": 229012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s867645712", "group_id": "codeNet:p03053", "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\n------\nlocal H, W = io.read(\"n\", \"n\", \"l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "language": "Lua", "metadata": {"date": 1557019485, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s867645712.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s867645712", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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\n------\nlocal H, W = io.read(\"n\", \"n\", \"l\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(io.read(\"l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1331, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s152711804", "group_id": "codeNet:p03053", "input_text": "local function str2tbl(s)\n    local t = {string.unpack(string.rep(\"c1\", #s), s)}\n    table.remove(t)\n    return t\nend\n\nlocal function setdefault(t, v)\n    setmetatable(t, {__index = function() return v end})\nend\n\nlocal function read_array(N)\n    local t, insert, read = {}, table.insert, io.read\n    for i=1, N do insert(t, read(\"n\")) end\n    return t\nend\n\nlocal function read(ptn)\n    local t = {}\n    local ptn = str2tbl(ptn)\n    for i=1, #ptn do\n        c = ptn[i]\n        if c == \"n\" then\n            table.insert(t, io.read(\"n\"))\n        elseif c == \"L\" then\n            io.read(\"l\")\n        elseif c == \"l\" then\n            table.insert(t, io.read(\"l\"))\n        end\n    end\n    return table.unpack(t)\nend\n\n------\nlocal H, W = read(\"nnL\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(read(\"l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "language": "Lua", "metadata": {"date": 1557019399, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s152711804.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s152711804", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local function str2tbl(s)\n    local t = {string.unpack(string.rep(\"c1\", #s), s)}\n    table.remove(t)\n    return t\nend\n\nlocal function setdefault(t, v)\n    setmetatable(t, {__index = function() return v end})\nend\n\nlocal function read_array(N)\n    local t, insert, read = {}, table.insert, io.read\n    for i=1, N do insert(t, read(\"n\")) end\n    return t\nend\n\nlocal function read(ptn)\n    local t = {}\n    local ptn = str2tbl(ptn)\n    for i=1, #ptn do\n        c = ptn[i]\n        if c == \"n\" then\n            table.insert(t, io.read(\"n\"))\n        elseif c == \"L\" then\n            io.read(\"l\")\n        elseif c == \"l\" then\n            table.insert(t, io.read(\"l\"))\n        end\n    end\n    return table.unpack(t)\nend\n\n------\nlocal H, W = read(\"nnL\")\nlocal grid = {}\nfor i=1, H do\n    grid[i] = str2tbl(read(\"l\"))\nend\n--[[\nfor i=1, H do\n    for j=1, W do\n        print(i,j, grid[i][j])\n    end\nend\n]]\nlocal count = 0\nwhile true do\n    local all_black = true\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '.' then\n                all_black = false\n                break\n            end\n        end\n    end\n    if all_black then\n        print(count)\n        return\n    end\n    local blacks = {}\n    for i=1, H do\n        for j=1, W do\n            local c = grid[i][j]\n            if c == '#' then\n                table.insert(blacks, {i, j})\n            end\n        end\n    end\n    for _, t in ipairs(blacks) do\n        local i, j = t[1], t[2]\n        if i >= 2 then\n            grid[i-1][j] = '#'\n        end\n        if i <= H - 1 then\n            grid[i+1][j] = '#'\n        end\n        if j >= 2 then\n            grid[i][j-1] = '#'\n        end\n        if j <= W - 1 then\n            grid[i][j+1] = '#'\n        end\n    end\n    --[[\n    print(count)\n    for i=1, H do\n        print(table.concat(grid[i], ''))\n    end\n    ]]\n    count = count + 1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1887, "cpu_time_ms": 1067, "memory_kb": 208888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s519131319", "group_id": "codeNet:p03053", "input_text": "local ior = io.input()\nlocal h, w = ior:read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h * w do map[i] = 0 end\nlocal str = \"\"\n\nlocal function getidx(wid, hgt)\n  return (hgt - 1) * w + wid\nend\n\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nfor i = 1, h do\n  str = ior:read()\n  for j = 1, w do\n    local idx = getidx(j, i)\n    if(str:sub(j, j) == \".\") then\n      map[idx] = 3000\n    else\n      table.insert(tasks, idx)\n      tasknum = tasknum + 1\n    end\n  end\nend\n\nlocal function walk(src, dst)\n  if(map[src] + 1 < map[dst]) then\n    map[dst] = map[src] + 1\n    table.insert(tasks, dst)\n    tasknum = tasknum + 1\n  end\nend\n\nwhile(done < tasknum) do\n  done = done + 1\n  local curidx = tasks[done]\n  if(w < curidx) then walk(curidx, curidx - w) end\n  if(curidx <= w * (h - 1)) then walk(curidx, curidx + w) end\n  if(w ~= 1 and curidx % w ~= 0) then walk(curidx, curidx + 1) end\n  if(w ~= 1 and curidx % w ~= 1) then walk(curidx, curidx - 1) end\nend\nlocal max = 0\nlocal mma = math.max\nfor i = 1, h * w do\n  max = mma(max, map[i])\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1557019178, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s519131319.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s519131319", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.input()\nlocal h, w = ior:read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h * w do map[i] = 0 end\nlocal str = \"\"\n\nlocal function getidx(wid, hgt)\n  return (hgt - 1) * w + wid\nend\n\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nfor i = 1, h do\n  str = ior:read()\n  for j = 1, w do\n    local idx = getidx(j, i)\n    if(str:sub(j, j) == \".\") then\n      map[idx] = 3000\n    else\n      table.insert(tasks, idx)\n      tasknum = tasknum + 1\n    end\n  end\nend\n\nlocal function walk(src, dst)\n  if(map[src] + 1 < map[dst]) then\n    map[dst] = map[src] + 1\n    table.insert(tasks, dst)\n    tasknum = tasknum + 1\n  end\nend\n\nwhile(done < tasknum) do\n  done = done + 1\n  local curidx = tasks[done]\n  if(w < curidx) then walk(curidx, curidx - w) end\n  if(curidx <= w * (h - 1)) then walk(curidx, curidx + w) end\n  if(w ~= 1 and curidx % w ~= 0) then walk(curidx, curidx + 1) end\n  if(w ~= 1 and curidx % w ~= 1) then walk(curidx, curidx - 1) end\nend\nlocal max = 0\nlocal mma = math.max\nfor i = 1, h * w do\n  max = mma(max, map[i])\nend\nprint(max)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 201, "memory_kb": 17660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s839437993", "group_id": "codeNet:p03053", "input_text": "local ior = io.input()\nlocal h, w = ior:read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h * w do map[i] = 0 end\nlocal str = \"\"\n\nlocal function getidx(wid, hgt)\n  return (hgt - 1) * w + wid\nend\n\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nfor i = 1, h do\n  str = ior:read()\n  for j = 1, w do\n    local idx = getidx(i, j)\n    if(str:sub(j, j) == \".\") then\n      map[idx] = 3000\n    else\n      table.insert(tasks, idx)\n      tasknum = tasknum + 1\n    end\n  end\nend\n\nlocal function walk(src, dst)\n  if(map[src] + 1 < map[dst]) then\n    map[dst] = map[src] + 1\n    table.insert(tasks, dst)\n    tasknum = tasknum + 1\n  end\nend\n\nwhile(done < tasknum) do\n  done = done + 1\n  local curidx = tasks[done]\n  if(w < curidx) then walk(curidx, curidx - w) end\n  if(curidx <= w * (h - 1)) then walk(curidx, curidx + w) end\n  if(curidx % w ~= 0) then walk(curidx, curidx + 1) end\n  if(curidx % w ~= 1) then walk(curidx, curidx - 1) end\nend\nlocal max = 0\nlocal mma = math.max\nfor i = 1, h * w do\n  max = mma(max, map[i])\nend\nprint(max)\n", "language": "Lua", "metadata": {"date": 1557018697, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lua/s839437993.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s839437993", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.input()\nlocal h, w = ior:read(\"*n\", \"*n\", \"*l\")\nlocal map = {}\nfor i = 1, h * w do map[i] = 0 end\nlocal str = \"\"\n\nlocal function getidx(wid, hgt)\n  return (hgt - 1) * w + wid\nend\n\nlocal tasks = {}\nlocal tasknum = 0\nlocal done = 0\n\nfor i = 1, h do\n  str = ior:read()\n  for j = 1, w do\n    local idx = getidx(i, j)\n    if(str:sub(j, j) == \".\") then\n      map[idx] = 3000\n    else\n      table.insert(tasks, idx)\n      tasknum = tasknum + 1\n    end\n  end\nend\n\nlocal function walk(src, dst)\n  if(map[src] + 1 < map[dst]) then\n    map[dst] = map[src] + 1\n    table.insert(tasks, dst)\n    tasknum = tasknum + 1\n  end\nend\n\nwhile(done < tasknum) do\n  done = done + 1\n  local curidx = tasks[done]\n  if(w < curidx) then walk(curidx, curidx - w) end\n  if(curidx <= w * (h - 1)) then walk(curidx, curidx + w) end\n  if(curidx % w ~= 0) then walk(curidx, curidx + 1) end\n  if(curidx % w ~= 1) then walk(curidx, curidx - 1) end\nend\nlocal max = 0\nlocal mma = math.max\nfor i = 1, h * w do\n  max = mma(max, map[i])\nend\nprint(max)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\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\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1026, "cpu_time_ms": 169, "memory_kb": 18560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s837642367", "group_id": "codeNet:p03061", "input_text": "local function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal left = {a[1]}\nfor i = 2, n - 1 do\n  left[i] = getgcd(left[i - 1], a[i])\nend\nlocal right = {a[n]}\nfor i = n - 1, 2, -1 do\n  right[n - i + 1] = getgcd(right[n - i], a[i])\nend\nlocal mmi, mma = math.min, math.max\nlocal ret = mma(left[n - 1], right[n - 1])\nfor i = 1, n - 2 do\n  local cand = getgcd(left[i], right[n - 1 - i])\n  ret = mma(ret, cand)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1584294277, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s837642367.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s837642367", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\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\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\nend\nlocal left = {a[1]}\nfor i = 2, n - 1 do\n  left[i] = getgcd(left[i - 1], a[i])\nend\nlocal right = {a[n]}\nfor i = n - 1, 2, -1 do\n  right[n - i + 1] = getgcd(right[n - i], a[i])\nend\nlocal mmi, mma = math.min, math.max\nlocal ret = mma(left[n - 1], right[n - 1])\nfor i = 1, n - 2 do\n  local cand = getgcd(left[i], right[n - 1 - i])\n  ret = mma(ret, cand)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 531, "cpu_time_ms": 79, "memory_kb": 6520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s230191010", "group_id": "codeNet:p03061", "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, 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 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 = self.func(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.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\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal mma = math.max\nlocal st = SegTree.new(a, function(x, y) return getgcd(x, y) end, 0)\nlocal ret = 1\nfor i = 1, n do\n  local tmp = a[i]\n  st:setValue(i, 0)\n  ret = mma(ret, st:getRange(1, n))\n  st:setValue(i, tmp)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1564539683, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s230191010.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230191010", "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, 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 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 = self.func(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.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\nlocal function getgcd(x, y)\n  while 0 < x do\n    x, y = y % x, x\n  end\n  return y\nend\nlocal n = io.read(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\nlocal mma = math.max\nlocal st = SegTree.new(a, function(x, y) return getgcd(x, y) end, 0)\nlocal ret = 1\nfor i = 1, n do\n  local tmp = a[i]\n  st:setValue(i, 0)\n  ret = mma(ret, st:getRange(1, n))\n  st:setValue(i, tmp)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2635, "cpu_time_ms": 225, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s373066278", "group_id": "codeNet:p03061", "input_text": "-- SegTree\n-- Ref: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal function SegTree(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n\n    -- private variables\n    -- func, ident are also private variables\n    local a = {}\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    local n = 1\n    -- end of private variables\n    -- constructor\n    do -- just make a scope\n        while n < #vec do\n            n = n << 1\n        end\n        local size = 2*n - 1\n        for i=1, size do\n            a[i] = ident\n        end\n        for i=1, #vec do\n            a[i+n-1] = vec[i]\n        end\n        for i=n-1,1,-1 do\n            a[i] = func(a[2*i], a[2*i+1])\n        end\n    end\n    vec = nil\n    -- public member functions\n    local self = {}\n    self.update = function(idx, val)\n        idx = idx + n - 1\n        a[idx] = val\n        while true do\n            idx = idx // 2\n            a[idx] = func(a[idx*2], a[idx*2 + 1])\n            if idx == 1 then\n                break\n            end\n        end\n    end\n    self.query = function(left, right)\n        -- query to [left, right)\n        -- **be careful about right half open interval**\n        local function q(k, l, r)\n            if r <= left or l >= right then\n                return ident\n            end\n            if l >= left and r <= right then\n                return a[k]\n            end\n            local vl = q(2*k  , l, (l+r)//2)\n            local vr = q(2*k+1, (l+r)//2, r)\n            return func(vl, vr)\n        end\n        return q(1, 1, n + 1)\n    end\n    return self\nend\n\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree(gcd, 0, A)\nlocal maxval = 0\nlocal mathmax = math.max\nlocal query = st.query\nfor i=1, N do\n    local left = query(1, i)\n    local right = query(i+1, N+1)\n    local g = gcd(left, right)\n    maxval = mathmax(maxval, g)\nend\nprint(maxval)\n", "language": "Lua", "metadata": {"date": 1556628739, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s373066278.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s373066278", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "-- SegTree\n-- Ref: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal function SegTree(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n\n    -- private variables\n    -- func, ident are also private variables\n    local a = {}\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    local n = 1\n    -- end of private variables\n    -- constructor\n    do -- just make a scope\n        while n < #vec do\n            n = n << 1\n        end\n        local size = 2*n - 1\n        for i=1, size do\n            a[i] = ident\n        end\n        for i=1, #vec do\n            a[i+n-1] = vec[i]\n        end\n        for i=n-1,1,-1 do\n            a[i] = func(a[2*i], a[2*i+1])\n        end\n    end\n    vec = nil\n    -- public member functions\n    local self = {}\n    self.update = function(idx, val)\n        idx = idx + n - 1\n        a[idx] = val\n        while true do\n            idx = idx // 2\n            a[idx] = func(a[idx*2], a[idx*2 + 1])\n            if idx == 1 then\n                break\n            end\n        end\n    end\n    self.query = function(left, right)\n        -- query to [left, right)\n        -- **be careful about right half open interval**\n        local function q(k, l, r)\n            if r <= left or l >= right then\n                return ident\n            end\n            if l >= left and r <= right then\n                return a[k]\n            end\n            local vl = q(2*k  , l, (l+r)//2)\n            local vr = q(2*k+1, (l+r)//2, r)\n            return func(vl, vr)\n        end\n        return q(1, 1, n + 1)\n    end\n    return self\nend\n\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree(gcd, 0, A)\nlocal maxval = 0\nlocal mathmax = math.max\nlocal query = st.query\nfor i=1, N do\n    local left = query(1, i)\n    local right = query(i+1, N+1)\n    local g = gcd(left, right)\n    maxval = mathmax(maxval, g)\nend\nprint(maxval)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2075, "cpu_time_ms": 1819, "memory_kb": 44920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s248623464", "group_id": "codeNet:p03061", "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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n * 2\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = math.floor(idx / 2)\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local h = math.floor((l+r)/2)\n        local vl = q(2*k  , l, h)\n        local vr = q(2*k+1, h, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"*n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"*n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "language": "Lua", "metadata": {"date": 1556600916, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s248623464.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248623464", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n * 2\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = math.floor(idx / 2)\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local h = math.floor((l+r)/2)\n        local vl = q(2*k  , l, h)\n        local vr = q(2*k+1, h, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"*n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"*n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2670, "cpu_time_ms": 281, "memory_kb": 7680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s552435353", "group_id": "codeNet:p03061", "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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n * 2\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = math.floor(idx / 2)\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local h = math.floor((l+r)/2)\n        local vl = q(2*k  , l, h)\n        local vr = q(2*k+1, h, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "language": "Lua", "metadata": {"date": 1556600818, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s552435353.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s552435353", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n * 2\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = math.floor(idx / 2)\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local h = math.floor((l+r)/2)\n        local vl = q(2*k  , l, h)\n        local vr = q(2*k+1, h, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2668, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s115441220", "group_id": "codeNet:p03061", "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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n << 1\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = idx // 2\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local vl = q(2*k  , l, (l+r)//2)\n        local vr = q(2*k+1, (l+r)//2, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "language": "Lua", "metadata": {"date": 1556600529, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s115441220.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s115441220", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n << 1\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    -- for verification\n    --[[\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    ]]\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = idx // 2\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local vl = q(2*k  , l, (l+r)//2)\n        local vr = q(2*k+1, (l+r)//2, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2634, "cpu_time_ms": 2106, "memory_kb": 53368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s240119216", "group_id": "codeNet:p03061", "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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n << 1\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = idx // 2\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local vl = q(2*k  , l, (l+r)//2)\n        local vr = q(2*k+1, (l+r)//2, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n--[[\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n]]\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "language": "Lua", "metadata": {"date": 1556600403, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s240119216.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240119216", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\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-- SegTree\n-- 参考にしました: http://tsutaj.hatenablog.com/entry/2017/03/29/204841\nlocal SegTree = {}\nfunction SegTree.new(func, ident, vec)\n    -- func: binary function\n    -- ident: identity element\n    -- vec: table\n    local self = setmetatable({}, {__index = SegTree})\n    self.func = func\n    self.ident = ident\n    local a = {}\n    self.a = a\n    local n = 1\n    while n < #vec do\n        n = n << 1\n    end\n    -- n is smallest power of 2 that is greater than or equal to #vec\n    self.n = n\n    local size = 2*n - 1\n    for i=1, size do\n        a[i] = ident\n    end\n    for i=1, #vec do\n        a[i+n-1] = vec[i]\n    end\n    for i=n-1,1,-1 do\n        a[i] = func(a[2*i], a[2*i+1])\n    end\n    return self\nend\n\nfunction SegTree:update(idx, val)\n    local a = self.a\n    local func = self.func\n    idx = idx + self.n - 1\n    a[idx] = val\n    while true do\n        idx = idx // 2\n        a[idx] = func(a[idx*2], a[idx*2 + 1])\n        if idx == 1 then\n            break\n        end\n    end\nend\n\nfunction SegTree:query(left, right)\n    -- query to [left, right)\n    -- **be careful about right half open interval**\n    local func = self.func\n    local ident = self.ident\n    local a = self.a\n    local function q(k, l, r)\n        if r <= left or l >= right then\n            return ident\n        end\n        if l >= left and r <= right then\n            return a[k]\n        end\n        local vl = q(2*k  , l, (l+r)//2)\n        local vr = q(2*k+1, (l+r)//2, r)\n        return func(vl, vr)\n    end\n    return q(1, 1, self.n + 1)\nend\n------\nlocal function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n----\n\nlocal N = io.read(\"n\")\nlocal A = {}\nfor i=1,N do\n    A[i] = io.read(\"n\")\nend\nlocal st = SegTree.new(gcd, 0, A)\n--[[\n-- for verification\nfor i=1, #st.a do\n    st.a[i] = 0\nend\nfor i=1, N do\n    st:update(i, A[i])\nend\n]]\ndbgpr_t(st.a)\nlocal maxval = 0\nfor i=1, N do\n    local left = st:query(1, i)\n    local right = st:query(i+1, N+1)\n    local g = gcd(left, right)\n    dbgpr(i, left, right, g)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2600, "cpu_time_ms": 1903, "memory_kb": 53368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s542527889", "group_id": "codeNet:p03061", "input_text": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal mesh = 60\n\nlocal groups = mac(n / mesh)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  local stt = 1 + (g - 1) * mesh\n  local last = (g == groups and n or g * mesh)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1556454608, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s542527889.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s542527889", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal mesh = 60\n\nlocal groups = mac(n / mesh)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  local stt = 1 + (g - 1) * mesh\n  local last = (g == groups and n or g * mesh)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 223, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s438490749", "group_id": "codeNet:p03061", "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\n----\n\nlocal N = io.read(\"n\")\nlocal A = {} for i=1,N do A[i] = io.read(\"n\") end\n\nlocal L, R = {}, {}\nL[1] = A[1]\nfor i=2, N do\n    L[i] = gcd(L[i-1], A[i])\nend\nR[N] = A[N]\nfor i=N-1, 1,-1 do\n    R[i] = gcd(R[i+1], A[i])\nend\n\nlocal maxval = 0\nmaxval = math.max(maxval, R[2])\nfor i=2, N-1 do\n    local g = gcd(L[i-1], R[i+1])\n    maxval = math.max(maxval, g)\nend\nmaxval = math.max(maxval, L[N-1])\n\nprint(maxval)", "language": "Lua", "metadata": {"date": 1556419794, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s438490749.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s438490749", "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\n----\n\nlocal N = io.read(\"n\")\nlocal A = {} for i=1,N do A[i] = io.read(\"n\") end\n\nlocal L, R = {}, {}\nL[1] = A[1]\nfor i=2, N do\n    L[i] = gcd(L[i-1], A[i])\nend\nR[N] = A[N]\nfor i=N-1, 1,-1 do\n    R[i] = gcd(R[i+1], A[i])\nend\n\nlocal maxval = 0\nmaxval = math.max(maxval, R[2])\nfor i=2, N-1 do\n    local g = gcd(L[i-1], R[i+1])\n    maxval = math.max(maxval, g)\nend\nmaxval = math.max(maxval, L[N-1])\n\nprint(maxval)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 649, "cpu_time_ms": 98, "memory_kb": 8556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s139276857", "group_id": "codeNet:p03061", "input_text": "function gcd(x, y, z)\n\treturn x<=z and z or y == 0 and x or gcd(y, x % y, z)\nend\nn = io.read\"*n\"\na = {}\nr=0\nfor i=1,n do\n\ta[i] = io.read\"*n\"\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], r)\n\tend\n\tr = t[1]\nend\nprint(r)\n", "language": "Lua", "metadata": {"date": 1556418930, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s139276857.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s139276857", "user_id": "u965456277"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function gcd(x, y, z)\n\treturn x<=z and z or y == 0 and x or gcd(y, x % y, z)\nend\nn = io.read\"*n\"\na = {}\nr=0\nfor i=1,n do\n\ta[i] = io.read\"*n\"\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], r)\n\tend\n\tr = t[1]\nend\nprint(r)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s002461238", "group_id": "codeNet:p03061", "input_text": "function gcd(x, y, z)\n\treturn x<z and z or y == 0 and x or gcd(y, x % y, z)\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], r)\n\tend\n\tr = t[1]\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1556418504, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s002461238.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s002461238", "user_id": "u965456277"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function gcd(x, y, z)\n\treturn x<z and z or y == 0 and x or gcd(y, x % y, z)\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], r)\n\tend\n\tr = t[1]\nend\nprint(r)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 16896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s008245127", "group_id": "codeNet:p03061", "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": 1556418359, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s008245127.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s008245127", "user_id": "u965456277"}, "prompt_components": {"gold_output": "2\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 : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s181464838", "group_id": "codeNet:p03061", "input_text": "function gcd(x, y, z)\n\treturn (x<z) and z or y == 0 and x or gcd(y, x % y, z)\nend\nn = io.read\"*n\"\na = {io.read(((\"*n\"):rep(n)):match((\"(*n)\"):rep(n)))}\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],r)\n\tend\n\tr=t[1]\nend\nprint(r)", "language": "Lua", "metadata": {"date": 1556417521, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s181464838.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s181464838", "user_id": "u965456277"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function gcd(x, y, z)\n\treturn (x<z) and z or y == 0 and x or gcd(y, x % y, z)\nend\nn = io.read\"*n\"\na = {io.read(((\"*n\"):rep(n)):match((\"(*n)\"):rep(n)))}\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],r)\n\tend\n\tr=t[1]\nend\nprint(r)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s450079198", "group_id": "codeNet:p03061", "input_text": "function gcd(x, y)\n\treturn y == 0 and x or gcd(y, x % y)\nend\nn = io.read\"*n\"\na = {io.read(((\"*n\"):rep(n)):match((\"(*n)\"):rep(n)))}\nr = {}\nfor i=1,n do\n\tt = {table.unpack(a)}\n\tt[i]=a[i+1] or a[i-1]\n\tr[i]=t[1]\n\tfor j=1,n-1 do\n\t\tr[i]=gcd(r[i],t[j+1])\n\tend\nend\nprint(math.max(table.unpack(r)))", "language": "Lua", "metadata": {"date": 1556416304, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s450079198.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s450079198", "user_id": "u965456277"}, "prompt_components": {"gold_output": "2\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 = {io.read(((\"*n\"):rep(n)):match((\"(*n)\"):rep(n)))}\nr = {}\nfor i=1,n do\n\tt = {table.unpack(a)}\n\tt[i]=a[i+1] or a[i-1]\n\tr[i]=t[1]\n\tfor j=1,n-1 do\n\t\tr[i]=gcd(r[i],t[j+1])\n\tend\nend\nprint(math.max(table.unpack(r)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 1204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s209951962", "group_id": "codeNet:p03061", "input_text": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal mesh = 500\n\nlocal groups = mac(n / mesh)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  local stt = 1 + (g - 1) * mesh\n  local last = (g == groups and n or g * mesh)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1556416103, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s209951962.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s209951962", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal mesh = 500\n\nlocal groups = mac(n / mesh)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / mesh)\n  local stt = 1 + (g - 1) * mesh\n  local last = (g == groups and n or g * mesh)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 945, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s551752840", "group_id": "codeNet:p03061", "input_text": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal groups = mac(n / 1000)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / 1000)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / 1000)\n  local stt = 1 + (g - 1) * 1000\n  local last = (g == groups and n or g * 1000)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1556415943, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s551752840.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s551752840", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.read\nlocal n = ior(\"*n\")\nlocal a = {}\nfor i = 1, n do a[i] = io.read(\"*n\") end\n\nlocal function getgcd(x, y)\n  while(0 < x and 0 < y) do\n    if(x < y) then y = y % x else x = x % y end\n  end\n  return math.max(x, y)\nend\n\nlocal mac = math.ceil\nlocal mam = math.max\n\nlocal groups = mac(n / 1000)\nlocal groupgcd = {}\nlocal group_inv_gcd = {}\nfor i = 1, groups do\n  groupgcd[i] = 0\n  group_inv_gcd[i] = 0\nend\n\nfor i = 1, n do\n  local g = mac(i / 1000)\n  groupgcd[g] = getgcd(groupgcd[g], a[i])\nend\n\nfor i = 1, groups do\n  for j = 1, groups do\n    if(i ~= j) then\n      group_inv_gcd[i] = getgcd(group_inv_gcd[i], groupgcd[j])\n    end\n  end\nend\n\nlocal ret = 0\n\nfor i = 1, n do\n  local g = mac(i / 1000)\n  local stt = 1 + (g - 1) * 1000\n  local last = (g == groups and n or g * 1000)\n  local cand = group_inv_gcd[g]\n  for j = stt, last do\n    if(j ~= i) then\n      cand = getgcd(cand, a[j])\n    end\n  end\n  ret = mam(ret, cand)\nend\nprint(ret)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s366066971", "group_id": "codeNet:p03061", "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 function gcdmany_notx(tbl, x)\n    local ans\n    if x ~= 1 then\n        ans = tbl[1]\n        for i=2,#tbl do\n            if i ~= x then\n                ans = gcd(ans, tbl[i])\n            end\n        end\n    else\n        -- x == 1\n        ans = tbl[2]\n        for i=3,#tbl do\n            ans = gcd(ans, tbl[i])\n        end\n    end\n    return ans\nend\n\n\nlocal N = io.read(\"n\")\nlocal A = {} for i=1,N do A[i] = io.read(\"n\") end\n\nlocal maxval = 0\nfor i=1, N do\n    local g = gcdmany_notx(A, i)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n\n", "language": "Lua", "metadata": {"date": 1556415552, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lua/s366066971.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s366066971", "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 function gcdmany_notx(tbl, x)\n    local ans\n    if x ~= 1 then\n        ans = tbl[1]\n        for i=2,#tbl do\n            if i ~= x then\n                ans = gcd(ans, tbl[i])\n            end\n        end\n    else\n        -- x == 1\n        ans = tbl[2]\n        for i=3,#tbl do\n            ans = gcd(ans, tbl[i])\n        end\n    end\n    return ans\nend\n\n\nlocal N = io.read(\"n\")\nlocal A = {} for i=1,N do A[i] = io.read(\"n\") end\n\nlocal maxval = 0\nfor i=1, N do\n    local g = gcdmany_notx(A, i)\n    maxval = math.max(maxval, g)\nend\nprint(maxval)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\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\nOutput\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 greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s525558671", "group_id": "codeNet:p03070", "input_text": "local mod = 998244353\nlocal mma, mmi = math.max, math.min\nlocal mfl = math.floor\n\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 a = {}\nlocal tot = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  tot = tot + a[i]\nend\nlocal htot = mfl(tot / 2)\nlocal dp = {}\nlocal single = {}\nlocal curmax = 0\nfor i = 1, htot do\n  dp[i] = 0\n  single[i] = 0\nend\nfor i = 1, n do\n  local ai = a[i]\n  local lim = mmi(curmax, htot - ai)\n  for j = lim, 1, -1 do\n    dp[j + ai] = badd(dp[j + ai], bmul(2, dp[j]))\n    single[j + ai] = badd(single[j + ai], single[j])\n  end\n  if ai <= htot then\n    dp[ai] = badd(dp[ai], 2)\n    single[ai] = badd(single[ai], 1)\n  end\n  curmax = curmax + ai\nend\nlocal ret = modpow(3, n)\nif tot % 2 == 0 then\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bsub(rmsum, single[htot])\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nelse\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1573015367, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s525558671.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525558671", "user_id": "u120582723"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local mod = 998244353\nlocal mma, mmi = math.max, math.min\nlocal mfl = math.floor\n\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 a = {}\nlocal tot = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  tot = tot + a[i]\nend\nlocal htot = mfl(tot / 2)\nlocal dp = {}\nlocal single = {}\nlocal curmax = 0\nfor i = 1, htot do\n  dp[i] = 0\n  single[i] = 0\nend\nfor i = 1, n do\n  local ai = a[i]\n  local lim = mmi(curmax, htot - ai)\n  for j = lim, 1, -1 do\n    dp[j + ai] = badd(dp[j + ai], bmul(2, dp[j]))\n    single[j + ai] = badd(single[j + ai], single[j])\n  end\n  if ai <= htot then\n    dp[ai] = badd(dp[ai], 2)\n    single[ai] = badd(single[ai], 1)\n  end\n  curmax = curmax + ai\nend\nlocal ret = modpow(3, n)\nif tot % 2 == 0 then\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bsub(rmsum, single[htot])\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nelse\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1533, "cpu_time_ms": 173, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s586015820", "group_id": "codeNet:p03070", "input_text": "local mod = 998244353\nlocal mma, mmi = math.max, math.min\nlocal mfl = math.floor\n\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 a = {}\nlocal tot = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  tot = tot + a[i]\nend\nlocal htot = mfl(tot / 2)\nlocal dp = {}\nlocal single = {}\nlocal curmax = 0\nfor i = 1, htot do\n  dp[i] = 0\n  single[i] = 0\nend\nfor i = 1, n do\n  local ai = a[i]\n  local lim = mmi(curmax, htot - ai)\n  for j = lim, 1, -1 do\n    dp[j + ai] = badd(dp[j + ai], bmul(2, dp[j]))\n    single[j + ai] = badd(single[j + ai], single[j])\n  end\n  dp[ai] = badd(dp[ai], 2)\n  single[ai] = badd(single[ai], 1)\n  curmax = curmax + ai\nend\nlocal ret = modpow(3, n)\nif tot % 2 == 0 then\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bsub(rmsum, single[htot])\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\n\nelse\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1573014865, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s586015820.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s586015820", "user_id": "u120582723"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local mod = 998244353\nlocal mma, mmi = math.max, math.min\nlocal mfl = math.floor\n\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 a = {}\nlocal tot = 0\nfor i = 1, n do\n  a[i] = io.read(\"*n\")\n  tot = tot + a[i]\nend\nlocal htot = mfl(tot / 2)\nlocal dp = {}\nlocal single = {}\nlocal curmax = 0\nfor i = 1, htot do\n  dp[i] = 0\n  single[i] = 0\nend\nfor i = 1, n do\n  local ai = a[i]\n  local lim = mmi(curmax, htot - ai)\n  for j = lim, 1, -1 do\n    dp[j + ai] = badd(dp[j + ai], bmul(2, dp[j]))\n    single[j + ai] = badd(single[j + ai], single[j])\n  end\n  dp[ai] = badd(dp[ai], 2)\n  single[ai] = badd(single[ai], 1)\n  curmax = curmax + ai\nend\nlocal ret = modpow(3, n)\nif tot % 2 == 0 then\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bsub(rmsum, single[htot])\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\n\nelse\n  local rmsum = 1\n  for i = 1, htot do\n    rmsum = badd(rmsum, dp[i])\n  end\n  rmsum = bmul(rmsum, 3)\n  ret = bsub(ret, rmsum)\nend\nprint(ret)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1503, "cpu_time_ms": 182, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s754687505", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local src = {}\n    default0(src)\n    src[0] = 1\n    for i=1,N do\n        local cur = a[i]\n        local dst = {}\n        default0(dst)\n        for k,v in pairs(src) do\n            dst[k] = v\n        end\n        for k,v in pairs(src) do\n            dst[k+cur] = (v + dst[k+cur]) % MOD\n        end\n        src, dst = dst, src\n    end\n    return src[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local src = {}\n    default0(src)\n    src[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        local dst = {}\n        default0(dst)\n        curmax = curmax + cur\n        for k,v in pairs(src) do\n            dst[k] = 2 * v % MOD\n        end\n        for k,v in pairs(src) do\n            dst[k+cur] = (v + dst[k+cur]) % MOD\n        end\n        src, dst = dst, src\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + src[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556165659, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s754687505.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s754687505", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local src = {}\n    default0(src)\n    src[0] = 1\n    for i=1,N do\n        local cur = a[i]\n        local dst = {}\n        default0(dst)\n        for k,v in pairs(src) do\n            dst[k] = v\n        end\n        for k,v in pairs(src) do\n            dst[k+cur] = (v + dst[k+cur]) % MOD\n        end\n        src, dst = dst, src\n    end\n    return src[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local src = {}\n    default0(src)\n    src[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        local dst = {}\n        default0(dst)\n        curmax = curmax + cur\n        for k,v in pairs(src) do\n            dst[k] = 2 * v % MOD\n        end\n        for k,v in pairs(src) do\n            dst[k+cur] = (v + dst[k+cur]) % MOD\n        end\n        src, dst = dst, src\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + src[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1781, "cpu_time_ms": 3030, "memory_kb": 26264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s636538160", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,90000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556164321, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s636538160.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636538160", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,90000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1739, "cpu_time_ms": 76, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s225388527", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,90000 do\n        t[i] = v\n    end\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556164177, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s225388527.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s225388527", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,90000 do\n        t[i] = v\n    end\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1598, "cpu_time_ms": 2335, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s037997370", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556159589, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s037997370.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037997370", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1740, "cpu_time_ms": 76, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s788041806", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556159521, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s788041806.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788041806", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[math.floor(S/2)]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --default0(cache)\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1740, "cpu_time_ms": 85, "memory_kb": 18432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s536012649", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal AMAX = 300\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --fill90000(cache, 0)\n    default0(cache)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556157448, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s536012649.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536012649", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal AMAX = 300\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\nlocal function default0(t)\n    local mt = {\n        __index = function(t,k)\n            return 0\n        end\n    }\n    setmetatable(t, mt)\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    default0(cache)\n    --fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    --fill90000(cache, 0)\n    default0(cache)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1804, "cpu_time_ms": 2441, "memory_kb": 2520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s617250752", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal AMAX = 300\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n        --[[\n        for s=cur-1,0,-1 do\n            cache[s] = cache[s]\n        end\n        ]]\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    -- math.ceil(S/2), S\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556155196, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s617250752.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s617250752", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal AMAX = 300\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal function fill90000(t, v)\n    for i=1,900000 do\n        t[i] = v\n    end\nend\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (cache[s] + cache[s-cur]) % MOD\n        end\n        --[[\n        for s=cur-1,0,-1 do\n            cache[s] = cache[s]\n        end\n        ]]\n    end\n    return cache[S//2]\nend\n\n-- ∑A >= S/2\nlocal function getX()\n    local cache = {}\n    fill90000(cache, 0)\n    cache[0] = 1\n    local curmax = 0\n    -- math.ceil(S/2), S\n    for i=1,N do\n        local cur = a[i]\n        curmax = curmax + cur\n        for s=curmax,cur,-1 do\n            cache[s] = (2 * cache[s] + cache[s-cur]) % MOD\n        end\n        for s=cur-1,0,-1 do\n            cache[s] = 2 * cache[s] % MOD\n        end\n    end\n    local sum = 0\n    for s = math.ceil(S/2), curmax, 1 do\n        sum = sum + cache[s]\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1795, "cpu_time_ms": 2371, "memory_kb": 18548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s729590773", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n--[[\nlocal function xxxmemoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n]]\n\nlocal function memoize(f)\n    local cache = {}\n    -- http://www.lua.org/doc/jucs05.pdf -- 4 Tables\n    -- Make keys contiguous integer so that elements always reside array part\n    for i=0, 301 * 90001 do\n        cache[i] = -1\n    end\n    -- i=0,s=0\n    cache[0] = 1\n    -- i=0,s!=0\n    for i=1, 90000 do\n        cache[i] = 0\n    end\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 90001) + s\n        if cache[k] >= 0 then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    --print(i, s, a[i])\n    return (combh(i - 1, s - a[i]) + combh(i - 1, s)) % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    return (combgeh(i - 1, s - a[i]) + combgeh(i - 1, s) * 2) % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        --local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + combgeh(N, s)) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556079691, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s729590773.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s729590773", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\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 xxxmemoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n]]\n\nlocal function memoize(f)\n    local cache = {}\n    -- http://www.lua.org/doc/jucs05.pdf -- 4 Tables\n    -- Make keys contiguous integer so that elements always reside array part\n    for i=0, 301 * 90001 do\n        cache[i] = -1\n    end\n    -- i=0,s=0\n    cache[0] = 1\n    -- i=0,s!=0\n    for i=1, 90000 do\n        cache[i] = 0\n    end\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 90001) + s\n        if cache[k] >= 0 then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    --print(i, s, a[i])\n    return (combh(i - 1, s - a[i]) + combh(i - 1, s)) % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    return (combgeh(i - 1, s - a[i]) + combgeh(i - 1, s) * 2) % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        --local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + combgeh(N, s)) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2510, "cpu_time_ms": 3190, "memory_kb": 1051000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361308064", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n--[[\nlocal function xxxmemoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n]]\n\nlocal function memoize(f)\n    local cache = {}\n    -- http://www.lua.org/doc/jucs05.pdf -- 4 Tables\n    -- Make keys contiguous integer so that elements always reside array part\n    for i=0, 301 * 90001 do\n        cache[i] = -1\n    end\n    -- i=0,s=0\n    cache[0] = 1\n    -- i=0,s!=0\n    for i=1, 90000 do\n        cache[i] = 0\n    end\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 90001) + s\n        if cache[k] >= 0 then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    --print(i, s, a[i])\n    return (combh(i - 1, s - a[i]) + combh(i - 1, s)) % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    return (combgeh(i - 1, s - a[i]) + combgeh(i - 1, s) * 2) % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        --local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + combgeh(N, s)) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556079408, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s361308064.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s361308064", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\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 xxxmemoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n]]\n\nlocal function memoize(f)\n    local cache = {}\n    -- http://www.lua.org/doc/jucs05.pdf -- 4 Tables\n    -- Make keys contiguous integer so that elements always reside array part\n    for i=0, 301 * 90001 do\n        cache[i] = -1\n    end\n    -- i=0,s=0\n    cache[0] = 1\n    -- i=0,s!=0\n    for i=1, 90000 do\n        cache[i] = 0\n    end\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 90001) + s\n        if cache[k] >= 0 then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    --print(i, s, a[i])\n    return (combh(i - 1, s - a[i]) + combh(i - 1, s)) % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    --[[\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    ]]\n    return (combgeh(i - 1, s - a[i]) + combgeh(i - 1, s) * 2) % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        --local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + combgeh(N, s)) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2510, "cpu_time_ms": 1180, "memory_kb": 524800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s033849498", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556076359, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s033849498.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s033849498", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    --elseif n % 2 == 0 then\n    --    return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1919, "cpu_time_ms": 3157, "memory_kb": 459280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s355548563", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1556066494, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s355548563.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s355548563", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        if s < 0 then\n            return 0\n        end\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\n--local ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1915, "cpu_time_ms": 3157, "memory_kb": 459388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s638280348", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555997551, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s638280348.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s638280348", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, math.floor(n/2), m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1860, "cpu_time_ms": 3157, "memory_kb": 337188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s891949487", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n/2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555997283, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s891949487.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s891949487", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i * 100000) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n/2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"*n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"*n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, math.floor(S/2))\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1848, "cpu_time_ms": 3157, "memory_kb": 337188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s239323382", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i<<17) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, S//2)\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555993151, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s239323382.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s239323382", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal function memoize(f)\n    local cache = {}\n    return function(i, s)\n        local k = (i<<17) + s\n        if cache[k] then\n            return cache[k]\n        end\n        local r = f(i, s)\n        cache[k] = r\n        return r\n    end\nend\n\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, S//2)\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) -- % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        --dbgpr(\"s,c\", s, c)\n        sum = (sum + c) --% MOD\n    end\n    return sum % MOD\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\n--dbgpr(Total, X, Y)\n--local ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nlocal ans = (Total - (3 * X) + (3 * Y)) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3156, "memory_kb": 393804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s870361186", "group_id": "codeNet:p03070", "input_text": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal 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\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, S//2)\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        dbgpr(\"s,c\", s, c)\n        sum = (sum + c) % MOD\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\ndbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1555992262, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03070.html", "problem_id": "p03070", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03070/input.txt", "sample_output_relpath": "derived/input_output/data/p03070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03070/Lua/s870361186.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s870361186", "user_id": "u162773977"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "local DBG = false\nlocal function dbgpr(...)\n    if DBG then\n        io.write(\"[dbg]\")\n        print(...)\n    end\nend\n\n--\nlocal 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\n-- returns (b^n) % m\nlocal function modpow(b, n, m)\n    if n == 0 then\n        return 1\n    elseif n % 2 == 0 then\n        return modpow(b * b % m, n//2, m) % m\n    else\n        return b * modpow(b, n - 1, m) % m\n    end\nend\n\n---\nlocal MOD = 998244353\nlocal N = io.read(\"n\")\nlocal a = {}\nlocal S = 0\nfor i=1,N do\n    a[i] = io.read(\"n\")\n    S = S + a[i]\nend\n\nlocal combh\ncombh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    --print(i, s, a[i])\n    local r = combh(i - 1, s - a[i])\n    r = r + combh(i - 1, s)\n    return r % MOD\nend)\n\n-- ∑A = S/2 and ∑B = S/2 and ∑C = 0\nlocal function getY()\n    if S % 2 == 1 then\n        return 0\n    end\n    return combh(N, S//2)\nend\n\nlocal combgeh\ncombgeh = memoize(function(i, s)\n    if i == 0 then\n        if s == 0 then\n            return 1\n        else\n            return 0\n        end\n    end\n    local r = combgeh(i - 1, s - a[i])\n    r = r + (combgeh(i - 1, s) * 2) % MOD\n    return r % MOD\nend)\n\n-- ∑A >= S/2\nlocal function getX()\n    local sum = 0\n    for s = math.ceil(S/2), S, 1 do\n        local c = combgeh(N, s)\n        dbgpr(\"s,c\", s, c)\n        sum = (sum + c) % MOD\n    end\n    return sum\nend\n\nlocal X, Y = getX(), getY()\nlocal Total = modpow(3, N, MOD)\ndbgpr(Total, X, Y)\nlocal ans = (Total - (3 * X) % MOD + (3 * Y) % MOD) % MOD\nprint(ans)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "sample_input": "4\n1\n1\n1\n2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03070", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given N integers. The i-th integer is a_i.\nFind the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:\n\nLet R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.\n\nConstraints\n\n3 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 300(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.\n\nSample Input 1\n\n4\n1\n1\n1\n2\n\nSample Output 1\n\n18\n\nWe can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.\n\nSample Input 2\n\n6\n1\n3\n2\n3\n5\n2\n\nSample Output 2\n\n150\n\nSample Input 3\n\n20\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n3\n2\n3\n8\n4\n\nSample Output 3\n\n563038556", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1962, "cpu_time_ms": 3165, "memory_kb": 195928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s374736684", "group_id": "codeNet:p03105", "input_text": "local a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(math.floor(b/a),c))", "language": "Lua", "metadata": {"date": 1579708015, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s374736684.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374736684", "user_id": "u373958718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(math.floor(b/a),c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s040872842", "group_id": "codeNet:p03105", "input_text": "local a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(math.floor(b/a),c))", "language": "Lua", "metadata": {"date": 1579707999, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s040872842.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040872842", "user_id": "u373958718"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local a,b,c=io.read(\"*n\",\"*n\",\"*n\")\nprint(math.min(math.floor(b/a),c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s827868220", "group_id": "codeNet:p03105", "input_text": "a, b, c = io.read(\"*n\", \"*n\", \"n\")\nprint(math.min(b // a, c))", "language": "Lua", "metadata": {"date": 1579345044, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s827868220.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s827868220", "user_id": "u720483676"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a, b, c = io.read(\"*n\", \"*n\", \"n\")\nprint(math.min(b // a, c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s183534432", "group_id": "codeNet:p03105", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nprint(math.min(c, b // a))\n", "language": "Lua", "metadata": {"date": 1556573588, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s183534432.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183534432", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nprint(math.min(c, b // a))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s376063278", "group_id": "codeNet:p03105", "input_text": "val = {}\nfor i=1, 3 do\n    val[i]=tonumber(io.read())\n    print(val[i]+1)\nend\n\nif val[1]*val[3]>=val[2] then\n\tprint(val[3])\nelse\n\tprint(math.floor(val[2]/val[1]))\nend\n", "language": "Lua", "metadata": {"date": 1552012131, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s376063278.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s376063278", "user_id": "u439737472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "val = {}\nfor i=1, 3 do\n    val[i]=tonumber(io.read())\n    print(val[i]+1)\nend\n\nif val[1]*val[3]>=val[2] then\n\tprint(val[3])\nelse\n\tprint(math.floor(val[2]/val[1]))\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s299450487", "group_id": "codeNet:p03105", "input_text": "val = {}\nval = io.read()\n\nif val[1]*val[3]>=val[2] then\n\tprint(c)\nelse\n\tprint(math.floor(val[2]/val[1]))\nend\n", "language": "Lua", "metadata": {"date": 1552011787, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s299450487.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s299450487", "user_id": "u439737472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "val = {}\nval = io.read()\n\nif val[1]*val[3]>=val[2] then\n\tprint(c)\nelse\n\tprint(math.floor(val[2]/val[1]))\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s121909361", "group_id": "codeNet:p03105", "input_text": "io.read(a, b, c)\n\nif a*c>=b then\n\tprint(c)\nelse\n\tprint(math.floor(b/a))\nend", "language": "Lua", "metadata": {"date": 1552011686, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s121909361.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s121909361", "user_id": "u439737472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "io.read(a, b, c)\n\nif a*c>=b then\n\tprint(c)\nelse\n\tprint(math.floor(b/a))\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s079508512", "group_id": "codeNet:p03105", "input_text": "io.io.write(a, b, c)\n\nif a*c>=b then\n\tprint(c)\nelse\n\tprint(math.floor(b/a))\nend", "language": "Lua", "metadata": {"date": 1552011627, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s079508512.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s079508512", "user_id": "u439737472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "io.io.write(a, b, c)\n\nif a*c>=b then\n\tprint(c)\nelse\n\tprint(math.floor(b/a))\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462217595", "group_id": "codeNet:p03105", "input_text": "A,B,C=io.read(\"n\",\"n\",\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "language": "Lua", "metadata": {"date": 1551790860, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s462217595.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462217595", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "A,B,C=io.read(\"n\",\"n\",\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s791065092", "group_id": "codeNet:p03105", "input_text": "A,B,C=io.rear(\"n\",\"n\",\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "language": "Lua", "metadata": {"date": 1551790795, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s791065092.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s791065092", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "A,B,C=io.rear(\"n\",\"n\",\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s768368291", "group_id": "codeNet:p03105", "input_text": "A=io.rear(\"n\")\nB=io.rear(\"n\")\nC=io.rear(\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "language": "Lua", "metadata": {"date": 1551790690, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s768368291.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s768368291", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "A=io.rear(\"n\")\nB=io.rear(\"n\")\nC=io.rear(\"n\")\nif B//A>=C then\n  print(C)\n  else\n  print(B//A)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s264810426", "group_id": "codeNet:p03105", "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": 1551685487, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s264810426.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s264810426", "user_id": "u837412668"}, "prompt_components": {"gold_output": "4\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 : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s421041317", "group_id": "codeNet:p03105", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c*1)))", "language": "Lua", "metadata": {"date": 1551680770, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s421041317.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s421041317", "user_id": "u837412668"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c*1)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s150328560", "group_id": "codeNet:p03105", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c*1)))", "language": "Lua", "metadata": {"date": 1551680742, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s150328560.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s150328560", "user_id": "u837412668"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c*1)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793033250", "group_id": "codeNet:p03105", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c)))", "language": "Lua", "metadata": {"date": 1551680659, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s793033250.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s793033250", "user_id": "u837412668"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(math.min(b/a,c)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s182222378", "group_id": "codeNet:p03105", "input_text": "a,b,c = io.read(\"n\",\"n\",\"n\")\nq = b // a\nif (q > c) then\n    print(c)\nelse\n    print(q)\nend", "language": "Lua", "metadata": {"date": 1551643307, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lua/s182222378.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182222378", "user_id": "u162773977"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "a,b,c = io.read(\"n\",\"n\",\"n\")\nq = b // a\nif (q > c) then\n    print(c)\nelse\n    print(q)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\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\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s883962326", "group_id": "codeNet:p03160", "input_text": "local n=io.read(\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=math.maxinteger\nlocal dp={0,math.abs(h[2]-h[1])}\nfor i=3,n do\n    dp[i]=INF\nend\nfor i=3,n do\n    dp[i]=math.min(dp[i],dp[i-1]+math.abs(h[i]-h[i-1]))\n    dp[i]=math.min(dp[i],dp[i-2]+math.abs(h[i]-h[i-2]))\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1600457351, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s883962326.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s883962326", "user_id": "u045238009"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=math.maxinteger\nlocal dp={0,math.abs(h[2]-h[1])}\nfor i=3,n do\n    dp[i]=INF\nend\nfor i=3,n do\n    dp[i]=math.min(dp[i],dp[i-1]+math.abs(h[i]-h[i-1]))\n    dp[i]=math.min(dp[i],dp[i-2]+math.abs(h[i]-h[i-2]))\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 69, "memory_kb": 6340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646400188", "group_id": "codeNet:p03160", "input_text": "n=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0,math.abs(h[1]-h[2])}\n\nfor i=3,n do\ndp[i]=math.min(dp[i-2]+math.abs(h[i-2]-h[i]),dp[i-1]+math.abs(h[i-1]-h[i]))\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1587338023, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s646400188.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646400188", "user_id": "u726173718"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "n=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0,math.abs(h[1]-h[2])}\n\nfor i=3,n do\ndp[i]=math.min(dp[i-2]+math.abs(h[i-2]-h[i]),dp[i-1]+math.abs(h[i-1]-h[i]))\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 2304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s604634081", "group_id": "codeNet:p03160", "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 function array(n, default_val)\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N = read.n()\nlocal h = read.N(N)\nlocal function diff(i, j)\n    if j > N then\n        return 10^9\n    end\n    return math.abs(h[i] - h[j])\nend\nlocal tbl = array(1, 10^9)\ntbl[1] = 0\nfor i=1,N-1 do\n    tbl[i+1] = math.min(tbl[i+1], diff(i,i+1) + tbl[i])\n    tbl[i+2] = math.min(tbl[i+2], diff(i,i+2) + tbl[i])\nend\nprint(tbl[N])", "language": "Lua", "metadata": {"date": 1581539332, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s604634081.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604634081", "user_id": "u162773977"}, "prompt_components": {"gold_output": "30\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 array(n, default_val)\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N = read.n()\nlocal h = read.N(N)\nlocal function diff(i, j)\n    if j > N then\n        return 10^9\n    end\n    return math.abs(h[i] - h[j])\nend\nlocal tbl = array(1, 10^9)\ntbl[1] = 0\nfor i=1,N-1 do\n    tbl[i+1] = math.min(tbl[i+1], diff(i,i+1) + tbl[i])\n    tbl[i+2] = math.min(tbl[i+2], diff(i,i+2) + tbl[i])\nend\nprint(tbl[N])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1320, "cpu_time_ms": 205, "memory_kb": 13176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958312465", "group_id": "codeNet:p03160", "input_text": "local n = io.read(\"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 3, n do\n  r[i] = min(r[i - 1] + abs(t[i] - t[i - 1]), r[i - 2] + abs(t[i] - t[i - 2]))\nend\nprint(r[n])\n", "language": "Lua", "metadata": {"date": 1566638313, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s958312465.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958312465", "user_id": "u120582723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 3, n do\n  r[i] = min(r[i - 1] + abs(t[i] - t[i - 1]), r[i - 2] + abs(t[i] - t[i - 2]))\nend\nprint(r[n])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 4444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s281913831", "group_id": "codeNet:p03160", "input_text": "n=tonumber(io.read())\nstr=io.read()\nh={}\nfor w in string.gmatch(str,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nfunction cal(i)\n\tif(memo[i]~=nil) then\n\t\treturn memo[i]\n\tend\n\tlocal way1=cal(i-1)+math.abs(h[i]-h[i-1])\n\tlocal way2=99999999\n\tif(i>2) then\n\t\tway2=cal(i-2)+math.abs(h[i]-h[i-2])\n\tend\n\tif(way1<way2) then\n\t\tmemo[i]=way1\n\telse\n\t\tmemo[i]=way2\n\tend\n\treturn memo[i]\nend\nmemo[1]=0\nmemo[2]=math.abs(h[2]-h[1])\nprint(math.floor(cal(n)))", "language": "Lua", "metadata": {"date": 1559505789, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s281913831.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281913831", "user_id": "u415400221"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "n=tonumber(io.read())\nstr=io.read()\nh={}\nfor w in string.gmatch(str,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nfunction cal(i)\n\tif(memo[i]~=nil) then\n\t\treturn memo[i]\n\tend\n\tlocal way1=cal(i-1)+math.abs(h[i]-h[i-1])\n\tlocal way2=99999999\n\tif(i>2) then\n\t\tway2=cal(i-2)+math.abs(h[i]-h[i-2])\n\tend\n\tif(way1<way2) then\n\t\tmemo[i]=way1\n\telse\n\t\tmemo[i]=way2\n\tend\n\treturn memo[i]\nend\nmemo[1]=0\nmemo[2]=math.abs(h[2]-h[1])\nprint(math.floor(cal(n)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 436, "cpu_time_ms": 134, "memory_kb": 19872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s561937191", "group_id": "codeNet:p03160", "input_text": "n=tonumber(io.read())\nstr=io.read()\nh={}\nfor w in string.gmatch(str,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nfunction cal(i)\n\tif(memo[i]~=nil) then\n\t\treturn memo[i]\n\tend\n\tlocal way1=cal(i-1)+math.abs(h[i]-h[i-1])\n\tlocal way2=99999999\n\tif(i>2) then\n\t\tway2=cal(i-2)+math.abs(h[i]-h[i-2])\n\tend\n\tif(way1<way2) then\n\t\tmemo[i]=way1\n\telse\n\t\tmemo[i]=way2\n\tend\n\treturn memo[i]\nend\nmemo[1]=0\nmemo[2]=math.abs(h[2]-h[1])\nprint(cal(n))", "language": "Lua", "metadata": {"date": 1559505661, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lua/s561937191.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s561937191", "user_id": "u415400221"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "n=tonumber(io.read())\nstr=io.read()\nh={}\nfor w in string.gmatch(str,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nfunction cal(i)\n\tif(memo[i]~=nil) then\n\t\treturn memo[i]\n\tend\n\tlocal way1=cal(i-1)+math.abs(h[i]-h[i-1])\n\tlocal way2=99999999\n\tif(i>2) then\n\t\tway2=cal(i-2)+math.abs(h[i]-h[i-2])\n\tend\n\tif(way1<way2) then\n\t\tmemo[i]=way1\n\telse\n\t\tmemo[i]=way2\n\tend\n\treturn memo[i]\nend\nmemo[1]=0\nmemo[2]=math.abs(h[2]-h[1])\nprint(cal(n))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 139, "memory_kb": 19872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s462547045", "group_id": "codeNet:p03161", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=10^20\nlocal dp={0}\nfor i=2,n do\n    dp[i]=INF\nend\n\nfor i=1,n do\n    for j=1,k do\n        if i+j<=n then\n            dp[i+j]=math.min(dp[i+j],dp[i]+math.abs(h[i]-h[i+j]))\n        end\n    end\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1600457984, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s462547045.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462547045", "user_id": "u045238009"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=10^20\nlocal dp={0}\nfor i=2,n do\n    dp[i]=INF\nend\n\nfor i=1,n do\n    for j=1,k do\n        if i+j<=n then\n            dp[i+j]=math.min(dp[i+j],dp[i]+math.abs(h[i]-h[i+j]))\n        end\n    end\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 63, "memory_kb": 4612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s416771501", "group_id": "codeNet:p03161", "input_text": "local n,k=io.read(\"n\",\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=math.maxinteger\nlocal dp={0}\nfor i=2,n do\n    dp[i]=INF\nend\n\nfor i=1,n do\n    for j=1,k do\n        if i+j<=n then\n            dp[i+j]=math.min(dp[i+j],dp[i]+math.abs(h[i]-h[i+j]))\n        end\n    end\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1600457948, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s416771501.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s416771501", "user_id": "u045238009"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n,k=io.read(\"n\",\"n\")\nlocal h={}\nfor i=1,n do\n    h[i]=io.read(\"n\")\nend\n\nlocal INF=math.maxinteger\nlocal dp={0}\nfor i=2,n do\n    dp[i]=INF\nend\n\nfor i=1,n do\n    for j=1,k do\n        if i+j<=n then\n            dp[i+j]=math.min(dp[i+j],dp[i]+math.abs(h[i]-h[i+j]))\n        end\n    end\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1309, "memory_kb": 6312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s865509536", "group_id": "codeNet:p03161", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal h = {}\nlocal cost = {}\nfor i = 1, n do\n  h[i] = io.read(\"*n\")\n  cost[i] = 1000000007 * 100\nend\ncost[1] = 0\nfor i = 1, n - 1 do\n  local lim = mmi(k, n - i)\n  for j = 1, lim do\n    cost[i + j] = mmi(cost[i + j], cost[i] + mab(h[i + j] - h[i]))\n  end\nend\nprint(cost[n])\n", "language": "Lua", "metadata": {"date": 1597573880, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s865509536.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s865509536", "user_id": "u120582723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n, k = io.read(\"*n\", \"*n\")\nlocal h = {}\nlocal cost = {}\nfor i = 1, n do\n  h[i] = io.read(\"*n\")\n  cost[i] = 1000000007 * 100\nend\ncost[1] = 0\nfor i = 1, n - 1 do\n  local lim = mmi(k, n - i)\n  for j = 1, lim do\n    cost[i + j] = mmi(cost[i + j], cost[i] + mab(h[i + j] - h[i]))\n  end\nend\nprint(cost[n])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 964, "memory_kb": 6392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s251562918", "group_id": "codeNet:p03161", "input_text": "n=io.read\"*n\"\nk=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0}\nfor i=2,n do\ndp[i]=math.huge\nfor j=1,math.min(i-1,k) do\ndp[i]=math.min(dp[i-j]+math.abs(h[i]-h[i-j]),dp[i])\nend\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1587338418, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s251562918.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s251562918", "user_id": "u726173718"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "n=io.read\"*n\"\nk=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0}\nfor i=2,n do\ndp[i]=math.huge\nfor j=1,math.min(i-1,k) do\ndp[i]=math.min(dp[i-j]+math.abs(h[i]-h[i-j]),dp[i])\nend\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 60, "memory_kb": 2304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s780852855", "group_id": "codeNet:p03161", "input_text": "n=io.read\"*n\"\nk=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0}\nfor i=2,n do\nfor j=1,math.min(i-1,k) do\ndp[i]=math.min(dp[i-j]+math.abs(h[i]-h[i-j]),dp[i]or math.huge)\nend\nend\nprint(dp[n])", "language": "Lua", "metadata": {"date": 1587338343, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s780852855.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780852855", "user_id": "u726173718"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "n=io.read\"*n\"\nk=io.read\"*n\"\nh={}for i=1,n do\nh[i]=io.read\"*n\"end\n\ndp={0}\nfor i=2,n do\nfor j=1,math.min(i-1,k) do\ndp[i]=math.min(dp[i-j]+math.abs(h[i]-h[i-j]),dp[i]or math.huge)\nend\nend\nprint(dp[n])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 71, "memory_kb": 2304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s708669203", "group_id": "codeNet:p03161", "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 function array(n, default_val)\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, K = read.nn()\nlocal h = read.N(N)\nlocal function diff(i, j)\n    if j > N then\n        return 10^20\n    end\n    return math.abs(h[i] - h[j])\nend\nlocal tbl = array(1, 10^20)\ntbl[1] = 0\nfor i=1,N-1 do\n    for k=1,K do\n        tbl[i+k] = math.min(tbl[i+k], diff(i,i+k) + tbl[i])\n    end\nend\nprint(tbl[N])", "language": "Lua", "metadata": {"date": 1581539954, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s708669203.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s708669203", "user_id": "u162773977"}, "prompt_components": {"gold_output": "30\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 array(n, default_val)\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, K = read.nn()\nlocal h = read.N(N)\nlocal function diff(i, j)\n    if j > N then\n        return 10^20\n    end\n    return math.abs(h[i] - h[j])\nend\nlocal tbl = array(1, 10^20)\ntbl[1] = 0\nfor i=1,N-1 do\n    for k=1,K do\n        tbl[i+k] = math.min(tbl[i+k], diff(i,i+k) + tbl[i])\n    end\nend\nprint(tbl[N])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1299, "cpu_time_ms": 121, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s986953013", "group_id": "codeNet:p03161", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 2, n do\n  r[i] = r[i - 1] + abs(t[i] - t[i - 1])\n  for j = 2, k do\n    if i <= j then break end\n    r[i] = min(r[i], r[i - j] + abs(t[i] - t[i - j]))\n  end\nend\nprint(r[n])\n", "language": "Lua", "metadata": {"date": 1566638513, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s986953013.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s986953013", "user_id": "u120582723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 2, n do\n  r[i] = r[i - 1] + abs(t[i] - t[i - 1])\n  for j = 2, k do\n    if i <= j then break end\n    r[i] = min(r[i], r[i - j] + abs(t[i] - t[i - j]))\n  end\nend\nprint(r[n])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 62, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s826992983", "group_id": "codeNet:p03161", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 2, n do\n  r[i] = r[i - 1] + abs(t[i] - t[i - 1])\n  for j = 2, k do\n    if i <= j then break end\n    r[i] = min(r[i], r[i - j] + abs(t[i] - t[i - j]))\n  end\nend\nprint(r[n])\n", "language": "Lua", "metadata": {"date": 1566638460, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s826992983.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s826992983", "user_id": "u120582723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal t, r = {}, {}\nfor i = 1, n do\n  t[i] = io.read(\"*n\")\n  r[i] = 0\nend\nlocal abs, min = math.abs, math.min\nr[2] = abs(t[2] - t[1])\nfor i = 2, n do\n  r[i] = r[i - 1] + abs(t[i] - t[i - 1])\n  for j = 2, k do\n    if i <= j then break end\n    r[i] = min(r[i], r[i - j] + abs(t[i] - t[i - j]))\n  end\nend\nprint(r[n])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 2104, "memory_kb": 4444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s797837246", "group_id": "codeNet:p03161", "input_text": "str1=io.read()\nstr2=io.read()\ninfo={}\nh={}\nfor w in string.gmatch(str1,\"[^ ]+\")do\n\ttable.insert(info,w)\nend\nfor w in string.gmatch(str2,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nmemo[1]=0\nfunction cal(i,n,k)\n\tif(memo[i]~=nil)then\n\t\treturn memo[i]\n\tend\n\tlocal list={}\n\tlocal min=999999999\n\tfor j=i-1,i-k,-1 do\n\t\tif(j<1)then\n\t\t\tdo\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\tlist[j]=cal(j,n,k)+math.abs(h[i]-h[j])\n\t\tif(list[j]<min)then\n\t\t\tmin=list[j]\n\t\tend\n\tend\n\tif(min~=999999999)then\n\t\tmemo[i]=min\n\tend\n\treturn min\nend\nlocal a={}\nprint(math.floor(cal(tonumber(info[1]),tonumber(info[1]),tonumber(info[2]))))", "language": "Lua", "metadata": {"date": 1560025131, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lua/s797837246.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s797837246", "user_id": "u415400221"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "str1=io.read()\nstr2=io.read()\ninfo={}\nh={}\nfor w in string.gmatch(str1,\"[^ ]+\")do\n\ttable.insert(info,w)\nend\nfor w in string.gmatch(str2,\"[^ ]+\")do\n\ttable.insert(h,w)\nend\nmemo={}\nmemo[1]=0\nfunction cal(i,n,k)\n\tif(memo[i]~=nil)then\n\t\treturn memo[i]\n\tend\n\tlocal list={}\n\tlocal min=999999999\n\tfor j=i-1,i-k,-1 do\n\t\tif(j<1)then\n\t\t\tdo\n\t\t\t\tbreak\n\t\t\tend\n\t\tend\n\t\tlist[j]=cal(j,n,k)+math.abs(h[i]-h[j])\n\t\tif(list[j]<min)then\n\t\t\tmin=list[j]\n\t\tend\n\tend\n\tif(min~=999999999)then\n\t\tmemo[i]=min\n\tend\n\treturn min\nend\nlocal a={}\nprint(math.floor(cal(tonumber(info[1]),tonumber(info[1]),tonumber(info[2]))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\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 minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 588, "cpu_time_ms": 2116, "memory_kb": 219788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s808978382", "group_id": "codeNet:p03163", "input_text": "local n,m=io.read(\"n\",\"n\")\nlocal w,v={},{}\nfor i=1,n do\n    w[i],v[i]=io.read(\"n\",\"n\")\nend\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=0,m do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=0,m do\n        if j-w[i]>=0 then\n            dp[i+1][j]=math.max(dp[i+1][j],dp[i][j-w[i]]+v[i])\n        end\n        dp[i+1][j]=math.max(dp[i+1][j],dp[i][j])\n    end\nend\n\nprint(string.format(\"%d\",dp[n+1][m]))", "language": "Lua", "metadata": {"date": 1600509524, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s808978382.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s808978382", "user_id": "u045238009"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local n,m=io.read(\"n\",\"n\")\nlocal w,v={},{}\nfor i=1,n do\n    w[i],v[i]=io.read(\"n\",\"n\")\nend\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=0,m do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=0,m do\n        if j-w[i]>=0 then\n            dp[i+1][j]=math.max(dp[i+1][j],dp[i][j-w[i]]+v[i])\n        end\n        dp[i+1][j]=math.max(dp[i+1][j],dp[i][j])\n    end\nend\n\nprint(string.format(\"%d\",dp[n+1][m]))", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 272, "memory_kb": 106416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s966885115", "group_id": "codeNet:p03163", "input_text": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[101][100001]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "language": "Lua", "metadata": {"date": 1587381027, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s966885115.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966885115", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[101][100001]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 191, "memory_kb": 79232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s027180783", "group_id": "codeNet:p03163", "input_text": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[100][100000]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "language": "Lua", "metadata": {"date": 1587380968, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s027180783.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s027180783", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[100][100000]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 455, "memory_kb": 78464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s238756095", "group_id": "codeNet:p03163", "input_text": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[100][100]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "language": "Lua", "metadata": {"date": 1587380921, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s238756095.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s238756095", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local ffi=require\"ffi\"\nffi.cdef[[\nint scanf(const char*,...);\nint printf(const char*,...);\n]]\nlocal C=ffi.C\n\nlocal function max(a,b)return a<b and b or a end\n\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp=ffi.new(\"int64_t[100][100]\")\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nC.printf(\"%ld\\n\",dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 101, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s090943058", "group_id": "codeNet:p03163", "input_text": "local ffi=require\"ffi\"\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nprint(dp[N][W])", "language": "Lua", "metadata": {"date": 1587377555, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s090943058.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090943058", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local ffi=require\"ffi\"\nN=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nprint(dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 297, "memory_kb": 104340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s718805929", "group_id": "codeNet:p03163", "input_text": "N=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nprint(dp[N][W])", "language": "Lua", "metadata": {"date": 1587377246, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s718805929.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s718805929", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "N=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nprint(dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 2113, "memory_kb": 158840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s034549066", "group_id": "codeNet:p03163", "input_text": "N=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nfor i=0,N do print(table.concat(dp[i],\"\\t\"))end\nprint(dp[N][W])", "language": "Lua", "metadata": {"date": 1587377218, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s034549066.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s034549066", "user_id": "u726173718"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "N=io.read\"*n\"\nW=io.read\"*n\"\nw,v={},{}for i=1,N do\nw[i]=io.read\"*n\"\nv[i]=io.read\"*n\"end\n\ndp={[0]={}}\nfor i=0,W do dp[0][i]=0 end\n\nfor i=1,N do\ndp[i]={}\nfor j=0,W do\nif(j<w[i])then dp[i][j]=dp[i-1][j]\nelse dp[i][j]=math.max(dp[i-1][j-w[i]]+v[i],dp[i-1][j])end\nend\nend\nfor i=0,N do print(table.concat(dp[i],\"\\t\"))end\nprint(dp[N][W])", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 2113, "memory_kb": 166776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s694493814", "group_id": "codeNet:p03163", "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-- Create n dimension array.\nlocal function array(dimension, default_val)\n    local n = dimension\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, W = read.nn()\nlocal ws, vs = {}, {}\nfor i=1,N do\n    ws[i] = read.n()\n    vs[i] = read.n()\nend\n\n-- tbl[n][w]\nlocal tbl = array(2, 0)\ntbl[0][0] = 0\nfor i=0,N-1 do\n    for w, _ in pairs(tbl[i]) do\n        tbl[i+1][w] = math.max(tbl[i+1][w], tbl[i][w])\n        if w+ws[i+1] <= W then\n            local cur_val = tbl[i+1][w+ws[i+1]]\n            local try_val = tbl[i][w] + vs[i+1]\n            tbl[i+1][w+ws[i+1]] = math.max(cur_val, try_val)\n        end\n    end\nend\nlocal ans = 0\nfor w, _ in pairs(tbl[N]) do\n    ans = math.max(ans, tbl[N][w])\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1581549383, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s694493814.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694493814", "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\n----\n-- Create n dimension array.\nlocal function array(dimension, default_val)\n    local n = dimension\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, W = read.nn()\nlocal ws, vs = {}, {}\nfor i=1,N do\n    ws[i] = read.n()\n    vs[i] = read.n()\nend\n\n-- tbl[n][w]\nlocal tbl = array(2, 0)\ntbl[0][0] = 0\nfor i=0,N-1 do\n    for w, _ in pairs(tbl[i]) do\n        tbl[i+1][w] = math.max(tbl[i+1][w], tbl[i][w])\n        if w+ws[i+1] <= W then\n            local cur_val = tbl[i+1][w+ws[i+1]]\n            local try_val = tbl[i][w] + vs[i+1]\n            tbl[i+1][w+ws[i+1]] = math.max(cur_val, try_val)\n        end\n    end\nend\nlocal ans = 0\nfor w, _ in pairs(tbl[N]) do\n    ans = math.max(ans, tbl[N][w])\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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1614, "cpu_time_ms": 1432, "memory_kb": 89604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s158945484", "group_id": "codeNet:p03163", "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-- Create n dimension array.\nlocal function array(dimension, default_val)\n    local n = dimension\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, W = read.nn()\nlocal ws, vs = {}, {}\nfor i=1,N do\n    ws[i] = read.n()\n    vs[i] = read.n()\nend\n\n-- tbl[n][w]\nlocal tbl = array(2, 0)\ntbl[0][0] = 0\nfor i=0,N-1 do\n    for w, _ in pairs(tbl[i]) do\n        tbl[i+1][w] = math.max(tbl[i+1][w], tbl[i][w])\n        if w+ws[i+1] <= W then\n            local cur_val = tbl[i+1][w+ws[i+1]]\n            local try_val = tbl[i][w] + vs[i+1]\n            tbl[i+1][w+ws[i+1]] = math.max(cur_val, try_val)\n        end\n    end\nend\nlocal ans = 0\nfor w, _ in pairs(tbl[N]) do\n    ans = math.max(ans, tbl[N][w])\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1581549358, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s158945484.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s158945484", "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\n----\n-- Create n dimension array.\nlocal function array(dimension, default_val)\n    local n = dimension\n    local metatables = {}\n    if default_val ~= nil then\n        metatables[1] = {__index = function() return default_val end}\n    end\n    for i=2,n do\n        metatables[i] = {__index = function(parent, k)\n            local child = setmetatable({}, metatables[i-1])\n            rawset(parent, k, child)\n            return child\n        end}\n    end\n    return setmetatable({}, metatables[n])\nend\n----\nlocal N, W = read.nn()\nlocal ws, vs = {}, {}\nfor i=1,N do\n    ws[i] = read.n()\n    vs[i] = read.n()\nend\n\n-- tbl[n][w]\nlocal tbl = array(2, 0)\ntbl[0][0] = 0\nfor i=0,N-1 do\n    for w, _ in pairs(tbl[i]) do\n        tbl[i+1][w] = math.max(tbl[i+1][w], tbl[i][w])\n        if w+ws[i+1] <= W then\n            local cur_val = tbl[i+1][w+ws[i+1]]\n            local try_val = tbl[i][w] + vs[i+1]\n            tbl[i+1][w+ws[i+1]] = math.max(cur_val, try_val)\n        end\n    end\nend\nlocal ans = 0\nfor w, _ in pairs(tbl[N]) do\n    ans = math.max(ans, tbl[N][w])\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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1614, "cpu_time_ms": 2111, "memory_kb": 124452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s969799040", "group_id": "codeNet:p03163", "input_text": "local mma, mmi = math.max, math.min\nlocal mfl, mce = math.floor, math.ceil\nlocal function comp(a, b)\n  return a < b\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 n, W = io.read(\"*n\", \"*n\")\nlocal v, w = {}, {}\nlocal low_w = true\nfor i = 1, n do\n  w[i], v[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solve_low_w()\n  local t = {}\n  for i = 1, W do t[i] = 0 end\n  for i = 1, n do\n    for j = W - w[i], 1, -1 do\n      if 0 < t[j] then\n        t[j + w[i]] = mma(t[j + w[i]], t[j] + v[i])\n      end\n    end\n    t[w[i]] = mma(t[w[i]], v[i])\n  end\n  local ret = 0\n  for i = 1, W do ret = mma(ret, t[i]) end\n  return ret\nend\n\nlocal function solve_low_v()\n  local t = {}\n  for i = 1, 200000 do t[i] = 0 end\n  local v_cursum = 0\n  for i = 1, n do\n    local vlim = mmi(v_cursum, 200000 - v[i])\n    for j = vlim, 1, -1 do\n      if 0 < t[j] then\n        if t[j + v[i]] == 0 then\n          t[j + v[i]] = t[j] + w[i]\n        else\n          t[j + v[i]] = mmi(t[j + v[i]], t[j] + w[i])\n        end\n      end\n    end\n    if t[v[i]] == 0 then\n      t[v[i]] = w[i]\n    else\n      t[v[i]] = mmi(t[v[i]], w[i])\n    end\n    v_cursum = v_cursum + v[i]\n  end\n  local ret = 0\n  for i = 200000, 1, -1 do\n    if 0 < t[i] and t[i] <= W then ret = i break end\n  end\n  return ret\nend\nprint(solve_low_w())\n", "language": "Lua", "metadata": {"date": 1565604730, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lua/s969799040.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969799040", "user_id": "u120582723"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal mfl, mce = math.floor, math.ceil\nlocal function comp(a, b)\n  return a < b\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 n, W = io.read(\"*n\", \"*n\")\nlocal v, w = {}, {}\nlocal low_w = true\nfor i = 1, n do\n  w[i], v[i] = io.read(\"*n\", \"*n\")\nend\n\nlocal function solve_low_w()\n  local t = {}\n  for i = 1, W do t[i] = 0 end\n  for i = 1, n do\n    for j = W - w[i], 1, -1 do\n      if 0 < t[j] then\n        t[j + w[i]] = mma(t[j + w[i]], t[j] + v[i])\n      end\n    end\n    t[w[i]] = mma(t[w[i]], v[i])\n  end\n  local ret = 0\n  for i = 1, W do ret = mma(ret, t[i]) end\n  return ret\nend\n\nlocal function solve_low_v()\n  local t = {}\n  for i = 1, 200000 do t[i] = 0 end\n  local v_cursum = 0\n  for i = 1, n do\n    local vlim = mmi(v_cursum, 200000 - v[i])\n    for j = vlim, 1, -1 do\n      if 0 < t[j] then\n        if t[j + v[i]] == 0 then\n          t[j + v[i]] = t[j] + w[i]\n        else\n          t[j + v[i]] = mmi(t[j + v[i]], t[j] + w[i])\n        end\n      end\n    end\n    if t[v[i]] == 0 then\n      t[v[i]] = w[i]\n    else\n      t[v[i]] = mmi(t[v[i]], w[i])\n    end\n    v_cursum = v_cursum + v[i]\n  end\n  local ret = 0\n  for i = 200000, 1, -1 do\n    if 0 < t[i] and t[i] <= W then ret = i break end\n  end\n  return ret\nend\nprint(solve_low_w())\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\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": "p03163", "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^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\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\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1608, "cpu_time_ms": 129, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s476233843", "group_id": "codeNet:p03165", "input_text": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal length=dp[n+1][m+1]\nlocal answer={}\nwhile length>0 do\n    if s:byte(n)==t:byte(m) then\n        answer[length]=s:sub(n,n)\n        n=n-1\n        m=m-1\n        length=length-1\n    elseif dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    else\n        m=m-1\n    end\nend\nprint(table.concat(answer))", "language": "Lua", "metadata": {"date": 1600527309, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s476233843.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s476233843", "user_id": "u045238009"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal length=dp[n+1][m+1]\nlocal answer={}\nwhile length>0 do\n    if s:byte(n)==t:byte(m) then\n        answer[length]=s:sub(n,n)\n        n=n-1\n        m=m-1\n        length=length-1\n    elseif dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    else\n        m=m-1\n    end\nend\nprint(table.concat(answer))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 676, "cpu_time_ms": 224, "memory_kb": 102800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s395993989", "group_id": "codeNet:p03165", "input_text": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal length=dp[n+1][m+1]\nlocal answer={}\nwhile length>0 do\n    if s:byte(n)==t:byte(m) then\n        answer[length]=s:sub(n,n)\n        n=n-1\n        m=m-1\n        length=length-1\n    elseif dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    else\n        m=m-1\n    end\nend\nprint(table.concat(answer))", "language": "Lua", "metadata": {"date": 1600527188, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s395993989.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s395993989", "user_id": "u045238009"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal length=dp[n+1][m+1]\nlocal answer={}\nwhile length>0 do\n    if s:byte(n)==t:byte(m) then\n        answer[length]=s:sub(n,n)\n        n=n-1\n        m=m-1\n        length=length-1\n    elseif dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    else\n        m=m-1\n    end\nend\nprint(table.concat(answer))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 676, "cpu_time_ms": 2211, "memory_kb": 194764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s358481528", "group_id": "codeNet:p03165", "input_text": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal answer=\"\"\nwhile n>0 and m>0 do\n    if dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    elseif dp[n+1][m+1]==dp[n+1][m] then\n        m=m-1\n    else\n        answer=s:sub(n,n)..answer\n        n=n-1\n        m=m-1\n    end\nend\nprint(answer)", "language": "Lua", "metadata": {"date": 1600527133, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s358481528.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s358481528", "user_id": "u045238009"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal answer=\"\"\nwhile n>0 and m>0 do\n    if dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    elseif dp[n+1][m+1]==dp[n+1][m] then\n        m=m-1\n    else\n        answer=s:sub(n,n)..answer\n        n=n-1\n        m=m-1\n    end\nend\nprint(answer)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 619, "cpu_time_ms": 220, "memory_kb": 103272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s869634141", "group_id": "codeNet:p03165", "input_text": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal answer=\"\"\nwhile n>0 and m>0 do\n    if dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    elseif dp[n+1][m+1]==dp[n+1][m] then\n        m=m-1\n    else\n        answer=s:sub(n,n)..answer\n        n=n-1\n        m=m-1\n    end\nend\nprint(answer)", "language": "Lua", "metadata": {"date": 1600527111, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s869634141.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s869634141", "user_id": "u045238009"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s=io.read()\nlocal t=io.read()\nlocal n=#s\nlocal m=#t\n\nlocal dp={}\nfor i=1,n+1 do\n    dp[i]={}\n    for j=1,m+1 do\n        dp[i][j]=0\n    end\nend\n\nfor i=1,n do\n    for j=1,m do\n        if s:byte(i)==t:byte(j) then\n            dp[i+1][j+1]=math.max(dp[i][j]+1,dp[i+1][j],dp[i][j+1])\n        else\n            dp[i+1][j+1]=math.max(dp[i+1][j],dp[i][j+1])\n        end\n    end\nend\n\nlocal answer=\"\"\nwhile n>0 and m>0 do\n    if dp[n+1][m+1]==dp[n][m+1] then\n        n=n-1\n    elseif dp[n+1][m+1]==dp[n+1][m] then\n        m=m-1\n    else\n        answer=s:sub(n,n)..answer\n        n=n-1\n        m=m-1\n    end\nend\nprint(answer)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 619, "cpu_time_ms": 2213, "memory_kb": 194732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s940825701", "group_id": "codeNet:p03165", "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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = '\\\\'\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = '|'\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = '-'\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal i, j, next = #S, #T, tbl2[#S][#T]\nwhile next do\n    if next == '\\\\' then\n        insert(ans_revt, S[i])\n        i, j = i-1, j-1\n        next = tbl2[i][j]\n    elseif next == '|' then\n        i, j = i-1, j\n        next = tbl2[i][j]\n    elseif next == '-' then\n        i, j = i, j-1\n        next = tbl2[i][j]\n    end\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581893963, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s940825701.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940825701", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = '\\\\'\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = '|'\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = '-'\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal i, j, next = #S, #T, tbl2[#S][#T]\nwhile next do\n    if next == '\\\\' then\n        insert(ans_revt, S[i])\n        i, j = i-1, j-1\n        next = tbl2[i][j]\n    elseif next == '|' then\n        i, j = i-1, j\n        next = tbl2[i][j]\n    elseif next == '-' then\n        i, j = i, j-1\n        next = tbl2[i][j]\n    end\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2197, "cpu_time_ms": 333, "memory_kb": 196224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s821695637", "group_id": "codeNet:p03165", "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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = cons(ns, tbl2_i_1[j-1])\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = tbl2_i_1[j]\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = tbl2_i[j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581888560, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s821695637.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s821695637", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = cons(ns, tbl2_i_1[j-1])\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = tbl2_i_1[j]\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = tbl2_i[j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2099, "cpu_time_ms": 2169, "memory_kb": 1036928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s735601169", "group_id": "codeNet:p03165", "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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = cons(ns, tbl2_i_1[j-1])\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = tbl2_i_1[j]\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = tbl2_i_1[j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581888330, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s735601169.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s735601169", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    local tbl1_i = tbl1[i]\n    local tbl1_i_1 = tbl1[i-1]\n    local tbl2_i = tbl2[i]\n    local tbl2_i_1 = tbl2[i-1]\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1_i_1[j-1]\n            local ra = cons(ns, tbl2_i_1[j-1])\n            tbl1_i[j] = a+1\n            tbl2_i[j] = ra\n        else\n            local a = tbl1_i_1[j]\n            local b = tbl1_i[j-1]\n            if a > b then\n                tbl1_i[j] = a\n                tbl2_i[j] = tbl2_i_1[j]\n            else\n                tbl1_i[j] = b\n                tbl2_i[j] = tbl2_i_1[j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2101, "cpu_time_ms": 2167, "memory_kb": 1028352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s759938390", "group_id": "codeNet:p03165", "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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1[i-1][j-1]\n            local ra = cons(ns, tbl2[i-1][j-1])\n            tbl1[i][j] = a+1\n            tbl2[i][j] = ra\n        else\n            local a = tbl1[i-1][j]\n            local b = tbl1[i][j-1]\n            if a > b then\n                tbl1[i][j] = a\n                tbl2[i][j] = tbl2[i-1][j]\n            else\n                tbl1[i][j] = b\n                tbl2[i][j] = tbl2[i][j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581888139, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s759938390.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s759938390", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\nlocal unpack = table.unpack or unpack\nlocal insert = table.insert or insert\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl1 = array(2, 0)\nlocal tbl2 = array(2, nil)\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl1[i-1][j-1]\n            local ra = cons(ns, tbl2[i-1][j-1])\n            tbl1[i][j] = a+1\n            tbl2[i][j] = ra\n        else\n            local a = tbl1[i-1][j]\n            local b = tbl1[i][j-1]\n            if a > b then\n                tbl1[i][j] = a\n                tbl2[i][j] = tbl2[i-1][j]\n            else\n                tbl1[i][j] = b\n                tbl2[i][j] = tbl2[i][j-1]\n            end\n        end\n    end\nend\nif false then\n    print(tbl1[#S][#T])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl2[#S][#T]\nwhile it do\n    --print(it, it.val, it.next)\n    insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1995, "cpu_time_ms": 2162, "memory_kb": 958080}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s947155375", "group_id": "codeNet:p03165", "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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, nil})\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = cons(ns, tbl[i-1][j-1][2])\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\nif true then\n    print(tbl[#S][#T][1])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl[#S][#T][2]\nwhile it do\n    --print(it, it.val, it.next)\n    table.insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581886242, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s947155375.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s947155375", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, nil})\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = cons(ns, tbl[i-1][j-1][2])\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\nif true then\n    print(tbl[#S][#T][1])\n    return\nend\nlocal ans_revt = {}\nlocal it = tbl[#S][#T][2]\nwhile it do\n    --print(it, it.val, it.next)\n    table.insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1886, "cpu_time_ms": 2165, "memory_kb": 1016448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s236689942", "group_id": "codeNet:p03165", "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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, nil})\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = cons(ns, tbl[i-1][j-1][2])\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\nlocal ans_revt = {}\nlocal it = tbl[#S][#T][2]\nwhile it do\n    --print(it, it.val, it.next)\n    table.insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "language": "Lua", "metadata": {"date": 1581886001, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s236689942.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s236689942", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, nil})\n\nlocal function cons(val, next)\n    return {val = val, next = next}\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = cons(ns, tbl[i-1][j-1][2])\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\nlocal ans_revt = {}\nlocal it = tbl[#S][#T][2]\nwhile it do\n    --print(it, it.val, it.next)\n    table.insert(ans_revt, it.val)\n    it = it.next\nend\nlocal ans_revs = table.concat(ans_revt, \"\")\nprint(ans_revs:reverse())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1832, "cpu_time_ms": 2150, "memory_kb": 752768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s048563955", "group_id": "codeNet:p03165", "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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, {}})\nlocal function chmax(i, j, v)\n    if tbl[i][j] < v then\n        tbl[i][j] = v\n    end\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = {table.unpack(tbl[i-1][j-1][2])}\n            table.insert(ra, ns)\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\n\nprint(table.concat(tbl[#S][#T][2], \"\"))", "language": "Lua", "metadata": {"date": 1581885596, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s048563955.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s048563955", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axb\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\ntable.unpack = table.unpack or unpack\n----\nlocal S = setmetatable(read.l():totable(), {__index=function()return '!' end})\nlocal T = setmetatable(read.l():totable(), {__index=function()return '@' end})\nlocal tbl = array(2, {0, {}})\nlocal function chmax(i, j, v)\n    if tbl[i][j] < v then\n        tbl[i][j] = v\n    end\nend\n\nfor i=1,#S do\n    for j=1,#T do\n        local ns = S[i]\n        local nt = T[j]\n        if ns == nt then\n            local a = tbl[i-1][j-1][1]\n            local ra = {table.unpack(tbl[i-1][j-1][2])}\n            table.insert(ra, ns)\n            tbl[i][j] = {a+1, ra}\n        else\n            local a, ra = table.unpack(tbl[i-1][j])\n            local b, rb = table.unpack(tbl[i][j-1])\n            if a > b then\n                tbl[i][j] = {a, ra}\n            else\n                tbl[i][j] = {b, rb}\n            end\n        end\n    end\nend\n\nprint(table.concat(tbl[#S][#T][2], \"\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1712, "cpu_time_ms": 2167, "memory_kb": 1043840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s394878819", "group_id": "codeNet:p03165", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\nlocal ss = {}\nfor i = 1, n do ss[i] = s:sub(i, i) end\nlocal ts = {}\nfor i = 1, m do ts[i] = t:sub(i, i) end\n\nlocal str_s = ss[1]\nif ts[1] == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if ts[i_t] == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = ss[i_s]\n  if ts[1] == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if ts[i_t] == str_s then\n      if #ret[idx] < #ret[idx - m - 1] + 1 then\n        ret[idx] = ret[idx - m - 1] .. str_s\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "language": "Lua", "metadata": {"date": 1567335932, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s394878819.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394878819", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\nlocal ss = {}\nfor i = 1, n do ss[i] = s:sub(i, i) end\nlocal ts = {}\nfor i = 1, m do ts[i] = t:sub(i, i) end\n\nlocal str_s = ss[1]\nif ts[1] == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if ts[i_t] == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = ss[i_s]\n  if ts[1] == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if ts[i_t] == str_s then\n      if #ret[idx] < #ret[idx - m - 1] + 1 then\n        ret[idx] = ret[idx - m - 1] .. str_s\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 1514, "memory_kb": 899820}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s103904500", "group_id": "codeNet:p03165", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\nlocal ss = {}\nfor i = 1, n do ss[i] = s:sub(i, i) end\nlocal ts = {}\nfor i = 1, m do ts[i] = t:sub(i, i) end\n\nlocal str_s = ss[1]\nif ts[1] == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if ts[i_t] == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = ss[i_s]\n  if ts[1] == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if ts[i_t] == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "language": "Lua", "metadata": {"date": 1567335673, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s103904500.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s103904500", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\nlocal ss = {}\nfor i = 1, n do ss[i] = s:sub(i, i) end\nlocal ts = {}\nfor i = 1, m do ts[i] = t:sub(i, i) end\n\nlocal str_s = ss[1]\nif ts[1] == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if ts[i_t] == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = ss[i_s]\n  if ts[1] == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if ts[i_t] == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 848, "cpu_time_ms": 2149, "memory_kb": 861036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s282998155", "group_id": "codeNet:p03165", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "language": "Lua", "metadata": {"date": 1567335447, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s282998155.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s282998155", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if #ret[idx - 1] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 782, "cpu_time_ms": 2148, "memory_kb": 861028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s710118017", "group_id": "codeNet:p03165", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nlocal len = {}\nfor i = 1, n * m do ret[i], len[i] = \"\", 0 end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\n  len[1] = 1\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n    len[i_t] = 1\n  else\n    ret[i_t] = ret[i_t - 1]\n    len[i_t] = len[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if len[idx - 1] < len[idx - m] then\n      ret[idx] = ret[idx - m]\n      len[idx] = len[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n      len[idx] = len[idx - 1]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if len[idx] < #cand then\n        ret[idx] = cand\n        len[idx] = #cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "language": "Lua", "metadata": {"date": 1567335271, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s710118017.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s710118017", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nlocal len = {}\nfor i = 1, n * m do ret[i], len[i] = \"\", 0 end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\n  len[1] = 1\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n    len[i_t] = 1\n  else\n    ret[i_t] = ret[i_t - 1]\n    len[i_t] = len[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    if len[idx - 1] < len[idx - m] then\n      ret[idx] = ret[idx - m]\n      len[idx] = len[idx - m]\n    else\n      ret[idx] = ret[idx - 1]\n      len[idx] = len[idx - 1]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if len[idx] < #cand then\n        ret[idx] = cand\n        len[idx] = #cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 948, "cpu_time_ms": 2150, "memory_kb": 1000660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s239630241", "group_id": "codeNet:p03165", "input_text": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    ret[idx] = ret[idx - 1]\n    if #ret[idx] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "language": "Lua", "metadata": {"date": 1567335057, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lua/s239630241.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s239630241", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "local s = io.read()\nlocal t = io.read()\nlocal n, m = #s, #t\nlocal ret = {}\nfor i = 1, n * m do ret[i] = \"\" end\n\nlocal str_s = s:sub(1, 1)\nif t:sub(1, 1) == str_s then\n  ret[1] = str_s\nend\nfor i_t = 2, m do\n  if t:sub(i_t, i_t) == str_s then\n    ret[i_t] = str_s\n  else\n    ret[i_t] = ret[i_t - 1]\n  end\nend\nfor i_s = 2, n do\n  str_s = s:sub(i_s, i_s)\n  if t:sub(1, 1) == str_s then\n    ret[(i_s - 1) * m + 1] = str_s\n  end\n  for i_t = 2, m do\n    local idx = (i_s - 1) * m + i_t\n    ret[idx] = ret[idx - 1]\n    if #ret[idx] < #ret[idx - m] then\n      ret[idx] = ret[idx - m]\n    end\n    if t:sub(i_t, i_t) == str_s then\n      local cand = ret[idx - m - 1] .. str_s\n      if #ret[idx] < #cand then\n        ret[idx] = cand\n      end\n    end\n  end\nend\nprint(ret[n * m])\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 767, "cpu_time_ms": 2153, "memory_kb": 861036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s638977349", "group_id": "codeNet:p03206", "input_text": "s = io.read(\"*n\")\nif s == 25 then\n  print(\"Christmas\")\nend\nif s == 24 then\n  print(\"Christmas Eve\")\nend\nif s == 23 then\n  print(\"Christmas Eve Eve\")\nend\nif s == 22 then\n  print(\"Christmas Eve Eve Eve\")\nend\n", "language": "Lua", "metadata": {"date": 1587437440, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s638977349.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s638977349", "user_id": "u020604402"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "s = io.read(\"*n\")\nif s == 25 then\n  print(\"Christmas\")\nend\nif s == 24 then\n  print(\"Christmas Eve\")\nend\nif s == 23 then\n  print(\"Christmas Eve Eve\")\nend\nif s == 22 then\n  print(\"Christmas Eve Eve Eve\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 206, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s562138955", "group_id": "codeNet:p03206", "input_text": "s = io.read(\"*n\")\nif s == 25 then\n  print(\"Christmas\")\nend\nif s == 24 then\n  print(\"Christmas Eve\")\nend\nif s == 23 then\n  print(\"Christmas Eve Eve\")\nend\nif s == 22 then\n  print(\"Christmas Eve Eve Eve\")\nend\n", "language": "Lua", "metadata": {"date": 1587437417, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s562138955.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s562138955", "user_id": "u020604402"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "s = io.read(\"*n\")\nif s == 25 then\n  print(\"Christmas\")\nend\nif s == 24 then\n  print(\"Christmas Eve\")\nend\nif s == 23 then\n  print(\"Christmas Eve Eve\")\nend\nif s == 22 then\n  print(\"Christmas Eve Eve Eve\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s360374243", "group_id": "codeNet:p03206", "input_text": "local D = io.read(\"n\")\nlocal d = {}\nd[25]='Christmas' d[24]='Christmas Eve' d[23]='Christmas Eve Eve' d[22]='Christmas Eve Eve Eve'\nprint(d[D])", "language": "Lua", "metadata": {"date": 1565539575, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s360374243.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360374243", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local D = io.read(\"n\")\nlocal d = {}\nd[25]='Christmas' d[24]='Christmas Eve' d[23]='Christmas Eve Eve' d[22]='Christmas Eve Eve Eve'\nprint(d[D])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s235096891", "group_id": "codeNet:p03206", "input_text": "local D = io.read(\"n\")\nlocal s = D==25 and 'Christmas' or D==24 and 'Christmas Eve' or D==23 and 'Christmas Eve Eve' or D==22 and 'Christmas Eve Eve Eve'\nprint(s)", "language": "Lua", "metadata": {"date": 1565539484, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s235096891.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235096891", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local D = io.read(\"n\")\nlocal s = D==25 and 'Christmas' or D==24 and 'Christmas Eve' or D==23 and 'Christmas Eve Eve' or D==22 and 'Christmas Eve Eve Eve'\nprint(s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s024935315", "group_id": "codeNet:p03206", "input_text": "local D = io.read(\"n\")\nlocal s = D==25 and 'Christmas' or D==24 and 'Christmas Eve' or D==23 and 'Christmas Eve Eve' and D==22 or 'Christmas Eve Eve Eve'\nprint(s)", "language": "Lua", "metadata": {"date": 1565539442, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s024935315.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s024935315", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local D = io.read(\"n\")\nlocal s = D==25 and 'Christmas' or D==24 and 'Christmas Eve' or D==23 and 'Christmas Eve Eve' and D==22 or 'Christmas Eve Eve Eve'\nprint(s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s321132392", "group_id": "codeNet:p03206", "input_text": "local n = io.read(\"*n\")\nio.write(\"Christmas\")\nfor i = 24, n, -1 do\n  io.write(\" Eve\")\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1559007202, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s321132392.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321132392", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local n = io.read(\"*n\")\nio.write(\"Christmas\")\nfor i = 24, n, -1 do\n  io.write(\" Eve\")\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s286998733", "group_id": "codeNet:p03206", "input_text": "d=io.read(\"n\")\nif d==25 then \n  print(\"Christmas\")\nend\nif d==24 then \n  print(\"Christmas Eve\")\nend\nif d==23 then \n  print(\"Christmas Eve Eve\")\nend\nif d==22 then \n  print(\"Christmas Eve Eve Eve\")\nend\n", "language": "Lua", "metadata": {"date": 1548980347, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s286998733.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s286998733", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "d=io.read(\"n\")\nif d==25 then \n  print(\"Christmas\")\nend\nif d==24 then \n  print(\"Christmas Eve\")\nend\nif d==23 then \n  print(\"Christmas Eve Eve\")\nend\nif d==22 then \n  print(\"Christmas Eve Eve Eve\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s567814499", "group_id": "codeNet:p03206", "input_text": "d=io.read(\"n\")\nif d==25 then \n  print(\"Christmas\")\nend\nif d==24 then \n  print(\"Christmas Eve\")\nend\nif d==25 then \n  print(\"Christmas Eve Eve\")\nend\nif d==25 then \n  print(\"Christmas Eve Eve Eve\")\nend", "language": "Lua", "metadata": {"date": 1548980256, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s567814499.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s567814499", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "d=io.read(\"n\")\nif d==25 then \n  print(\"Christmas\")\nend\nif d==24 then \n  print(\"Christmas Eve\")\nend\nif d==25 then \n  print(\"Christmas Eve Eve\")\nend\nif d==25 then \n  print(\"Christmas Eve Eve Eve\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 3, "memory_kb": 504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s263172657", "group_id": "codeNet:p03206", "input_text": "local n = io.read(\"n\")\nlocal d = 25 - n\nlocal s = \"Christmas\"\nfor i = 1, d do\n  s = s .. \" Eve\"\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1548962947, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s263172657.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263172657", "user_id": "u200201528"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal d = 25 - n\nlocal s = \"Christmas\"\nfor i = 1, d do\n  s = s .. \" Eve\"\nend\nprint(s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s388381549", "group_id": "codeNet:p03206", "input_text": "local n = io.read(\"n\")\nlocal d = n - 25\nlocal s = \"Christmas\"\nfor i = 1, d do\n  s = s .. \" Eve\"\nend\nprint(s)", "language": "Lua", "metadata": {"date": 1548962845, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s388381549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s388381549", "user_id": "u200201528"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local n = io.read(\"n\")\nlocal d = n - 25\nlocal s = \"Christmas\"\nfor i = 1, d do\n  s = s .. \" Eve\"\nend\nprint(s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s924923959", "group_id": "codeNet:p03206", "input_text": "print((function (n, s)\n\tfor _=1,25-n do s=s..\" Eve\" end\n\treturn s\nend)(io.stdin:read(\"*n\"), \"Christmas\"))", "language": "Lua", "metadata": {"date": 1545800734, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s924923959.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924923959", "user_id": "u498802423"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "print((function (n, s)\n\tfor _=1,25-n do s=s..\" Eve\" end\n\treturn s\nend)(io.stdin:read(\"*n\"), \"Christmas\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s360954765", "group_id": "codeNet:p03206", "input_text": "local d = tonumber(io.read())\nlocal str = \"Christmas\"\nfor i=0,24-d,1 do\n  str=str..\" Eve\"\nend\nprint(str)", "language": "Lua", "metadata": {"date": 1544397730, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lua/s360954765.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360954765", "user_id": "u030685402"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "local d = tonumber(io.read())\nlocal str = \"Christmas\"\nfor i=0,24-d,1 do\n  str=str..\" Eve\"\nend\nprint(str)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s225079527", "group_id": "codeNet:p03240", "input_text": "local n=io.read(\"n\")\nlocal x={}\nlocal y={}\nlocal h={}\nlocal a\nfor i=1,n do\n    x[i]=io.read(\"n\")\n    y[i]=io.read(\"n\")\n    h[i]=io.read(\"n\")\n    if h[i]>=1 then\n        a=i\n    end\nend\n\nfor i=0,100 do\n    for j=0,100 do\n        local H=h[a]+math.abs(i-x[a])+math.abs(j-y[a])\n        local checker=true\n        for k=1,n do\n           if h[k]>0 and H-h[k]~=math.abs(i-x[k])+math.abs(j-y[k]) then\n            checker=false\n           end\n           if h[k]==0 and H>math.abs(i-x[k])+math.abs(j-y[k]) then\n            checker=false\n           end\n        end\n        if checker then\n            print(i,j,H)\n            return\n        end\n    end\nend", "language": "Lua", "metadata": {"date": 1595812406, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s225079527.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s225079527", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local n=io.read(\"n\")\nlocal x={}\nlocal y={}\nlocal h={}\nlocal a\nfor i=1,n do\n    x[i]=io.read(\"n\")\n    y[i]=io.read(\"n\")\n    h[i]=io.read(\"n\")\n    if h[i]>=1 then\n        a=i\n    end\nend\n\nfor i=0,100 do\n    for j=0,100 do\n        local H=h[a]+math.abs(i-x[a])+math.abs(j-y[a])\n        local checker=true\n        for k=1,n do\n           if h[k]>0 and H-h[k]~=math.abs(i-x[k])+math.abs(j-y[k]) then\n            checker=false\n           end\n           if h[k]==0 and H>math.abs(i-x[k])+math.abs(j-y[k]) then\n            checker=false\n           end\n        end\n        if checker then\n            print(i,j,H)\n            return\n        end\n    end\nend", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 647, "cpu_time_ms": 161, "memory_kb": 2788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s720390291", "group_id": "codeNet:p03240", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nlocal iref = 0\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\n  if 0 < h[i] then iref = i end\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hi = mab(xi - x[iref]) + mab(yi - y[iref]) + h[iref]\n    local v = true\n    for i = 1, n do\n      if mma(0, hi - mab(xi - x[i]) - mab(yi - y[i])) ~= h[i] then\n        v = false\n        break\n      end\n    end\n    if v then\n      print(xi .. \" \" .. yi .. \" \" .. hi)\n      os.exit()\n    end\n  end\nend\n", "language": "Lua", "metadata": {"date": 1589049646, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s720390291.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s720390291", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nlocal iref = 0\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\n  if 0 < h[i] then iref = i end\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hi = mab(xi - x[iref]) + mab(yi - y[iref]) + h[iref]\n    local v = true\n    for i = 1, n do\n      if mma(0, hi - mab(xi - x[i]) - mab(yi - y[i])) ~= h[i] then\n        v = false\n        break\n      end\n    end\n    if v then\n      print(xi .. \" \" .. yi .. \" \" .. hi)\n      os.exit()\n    end\n  end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 571, "cpu_time_ms": 6, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s652886704", "group_id": "codeNet:p03240", "input_text": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hmin, hmax = 1, 1000000000\n    for i = 1, n do\n      if 0 < h[i] then\n        local v = mab(xi - x[i]) + mab(yi - y[i]) + h[i]\n        hmax = mmi(hmax, v)\n        hmin = mma(hmin, v)\n      else\n        local v = mab(xi - x[i]) + mab(yi - y[i])\n        hmax = mmi(hmax, v)\n      end\n    end\n    if hmin == hmax then\n      print(xi .. \" \" .. yi .. \" \" .. hmin)\n      os.exit()\n    end\n  end\nend\n", "language": "Lua", "metadata": {"date": 1589049497, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s652886704.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s652886704", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local mmi, mma = math.min, math.max\nlocal mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hmin, hmax = 1, 1000000000\n    for i = 1, n do\n      if 0 < h[i] then\n        local v = mab(xi - x[i]) + mab(yi - y[i]) + h[i]\n        hmax = mmi(hmax, v)\n        hmin = mma(hmin, v)\n      else\n        local v = mab(xi - x[i]) + mab(yi - y[i])\n        hmax = mmi(hmax, v)\n      end\n    end\n    if hmin == hmax then\n      print(xi .. \" \" .. yi .. \" \" .. hmin)\n      os.exit()\n    end\n  end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 618, "cpu_time_ms": 337, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s189348351", "group_id": "codeNet:p03240", "input_text": "local mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hi = mab(xi - x[1]) + mab(yi - y[1]) + h[1]\n    local v = true\n    for i = 2, n do\n      if mab(xi - x[i]) + mab(yi - y[i]) + h[i] ~= hi then\n        v = false\n        break\n      end\n    end\n    if v then\n      print(xi .. \" \" .. yi .. \" \" .. hi)\n      os.exit()\n    end\n  end\nend\n", "language": "Lua", "metadata": {"date": 1589048802, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s189348351.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s189348351", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local mab = math.abs\nlocal n = io.read(\"*n\")\nlocal x, y, h = {}, {}, {}\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\nend\nfor xi = 0, 100 do\n  for yi = 0, 100 do\n    local hi = mab(xi - x[1]) + mab(yi - y[1]) + h[1]\n    local v = true\n    for i = 2, n do\n      if mab(xi - x[i]) + mab(yi - y[i]) + h[i] ~= hi then\n        v = false\n        break\n      end\n    end\n    if v then\n      print(xi .. \" \" .. yi .. \" \" .. hi)\n      os.exit()\n    end\n  end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 471, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s547821942", "group_id": "codeNet:p03240", "input_text": "local math_abs = math.abs\nlocal function distance(x1,y1,x2,y2)\n    return math_abs(x1 - x2) + math_abs(y1 - y2)\nend\n\nlocal N = io.read(\"n\")\n\nlocal hints = {}\nlocal hint_nonzero_x, hint_nonzero_y, hint_nonzero_h\nfor i=1,N do\n    local x, y, h = io.read(\"n\", \"n\", \"n\")\n    hints[i] = {x, y, h}\n    if h ~= 0 then\n        hint_nonzero_x, hint_nonzero_y, hint_nonzero_h = x, y, h\n    end\nend\n\nfor cx=0,100 do\n    for cy=0,100 do\n        local h = hint_nonzero_h + distance(cx,cy,hint_nonzero_x,hint_nonzero_y)\n        local ok = true\n        for i=1,N do\n            local hx, hy, hh = table.unpack(hints[i])\n            if (h - distance(cx,cy,hx,hy) == hh) or\n                (hh == 0 and h - distance(cx,cy,hx,hy) < 0)\n            then\n            else\n                ok = false\n                break\n            end\n        end\n        if ok then\n            print(table.concat({cx, cy, h}, ' '))\n            return\n        end\n    end\nend\n    \n", "language": "Lua", "metadata": {"date": 1565620422, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s547821942.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s547821942", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local math_abs = math.abs\nlocal function distance(x1,y1,x2,y2)\n    return math_abs(x1 - x2) + math_abs(y1 - y2)\nend\n\nlocal N = io.read(\"n\")\n\nlocal hints = {}\nlocal hint_nonzero_x, hint_nonzero_y, hint_nonzero_h\nfor i=1,N do\n    local x, y, h = io.read(\"n\", \"n\", \"n\")\n    hints[i] = {x, y, h}\n    if h ~= 0 then\n        hint_nonzero_x, hint_nonzero_y, hint_nonzero_h = x, y, h\n    end\nend\n\nfor cx=0,100 do\n    for cy=0,100 do\n        local h = hint_nonzero_h + distance(cx,cy,hint_nonzero_x,hint_nonzero_y)\n        local ok = true\n        for i=1,N do\n            local hx, hy, hh = table.unpack(hints[i])\n            if (h - distance(cx,cy,hx,hy) == hh) or\n                (hh == 0 and h - distance(cx,cy,hx,hy) < 0)\n            then\n            else\n                ok = false\n                break\n            end\n        end\n        if ok then\n            print(table.concat({cx, cy, h}, ' '))\n            return\n        end\n    end\nend\n    \n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 945, "cpu_time_ms": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s709569191", "group_id": "codeNet:p03240", "input_text": "local mab, mma = math.abs, math.max\nlocal ior = io.input()\nlocal n = ior:read(\"*n\")\nlocal x, y, h = {}, {}, {}\nlocal ref = 1\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\n  if 0 < h[i] then ref = i end\nend\nlocal found = false\nfor cx = 0, 100 do\n  for cy = 0, 100 do\n    local ch = h[ref] + mab(cx - x[ref]) + mab(cy - y[ref])\n    local valid = true\n    for i = 1, n do\n      if h[i] ~= mma(0, ch - mab(cx - x[i]) - mab(cy - y[i])) then\n        valid = false\n        break\n      end\n    end\n    if valid then\n      found = true\n      print(cx .. \" \" .. cy ..\" \" .. ch)\n      break\n    end\n  end\n  if found then break end\nend\n", "language": "Lua", "metadata": {"date": 1559016097, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s709569191.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s709569191", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "local mab, mma = math.abs, math.max\nlocal ior = io.input()\nlocal n = ior:read(\"*n\")\nlocal x, y, h = {}, {}, {}\nlocal ref = 1\nfor i = 1, n do\n  x[i], y[i], h[i] = io.read(\"*n\", \"*n\", \"*n\")\n  if 0 < h[i] then ref = i end\nend\nlocal found = false\nfor cx = 0, 100 do\n  for cy = 0, 100 do\n    local ch = h[ref] + mab(cx - x[ref]) + mab(cy - y[ref])\n    local valid = true\n    for i = 1, n do\n      if h[i] ~= mma(0, ch - mab(cx - x[i]) - mab(cy - y[i])) then\n        valid = false\n        break\n      end\n    end\n    if valid then\n      found = true\n      print(cx .. \" \" .. cy ..\" \" .. ch)\n      break\n    end\n  end\n  if found then break end\nend\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s025897935", "group_id": "codeNet:p03240", "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 = tonumber(io.read())\nlocal x = {}\nlocal y = {}\nlocal h = {}\nfor i=1,n,1 do\n  local arr = input()\n  x[i] = arr[1]\n  y[i] = arr[2]\n  h[i] = arr[3]\nend\nlocal cx,cy\nlocal H = 1e9+7\nfor i=0,100,1 do\n  for j=0,100,1 do\n    cx=i\n    cy=j\n    local flag = true\n    for k=1,n,1 do\n      local dx = math.abs(cx-x[k])\n      local dy = math.abs(cy-y[k])\n      if h[k]~=0 then\n        local Hi = h[k]+dx+dy\n        H = Hi\n      end\n    end\n    for k=1,n,1 do\n      local dx = math.abs(cx-x[k])\n      local dy = math.abs(cy-y[k])\n      local Hi = h[k]+dx+dy\n      if h[k]==0 then\n        if H>Hi then\n          flag = false\n        end\n      else\n        if H~=Hi then\n          flag = false\n        end\n      end\n    end\n    if flag then\n      local res = tostring(cx)..\" \"..tostring(cy)..\" \"..tostring(H)\n      print(res)\n    end\n  end\nend\n    ", "language": "Lua", "metadata": {"date": 1544412434, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lua/s025897935.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025897935", "user_id": "u030685402"}, "prompt_components": {"gold_output": "2 2 6\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 = tonumber(io.read())\nlocal x = {}\nlocal y = {}\nlocal h = {}\nfor i=1,n,1 do\n  local arr = input()\n  x[i] = arr[1]\n  y[i] = arr[2]\n  h[i] = arr[3]\nend\nlocal cx,cy\nlocal H = 1e9+7\nfor i=0,100,1 do\n  for j=0,100,1 do\n    cx=i\n    cy=j\n    local flag = true\n    for k=1,n,1 do\n      local dx = math.abs(cx-x[k])\n      local dy = math.abs(cy-y[k])\n      if h[k]~=0 then\n        local Hi = h[k]+dx+dy\n        H = Hi\n      end\n    end\n    for k=1,n,1 do\n      local dx = math.abs(cx-x[k])\n      local dy = math.abs(cy-y[k])\n      local Hi = h[k]+dx+dy\n      if h[k]==0 then\n        if H>Hi then\n          flag = false\n        end\n      else\n        if H~=Hi then\n          flag = false\n        end\n      end\n    end\n    if flag then\n      local res = tostring(cx)..\" \"..tostring(cy)..\" \"..tostring(H)\n      print(res)\n    end\n  end\nend\n    ", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 489, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s218620640", "group_id": "codeNet:p03250", "input_text": "local read = setmetatable({}, {__index = function(t, k) return function() local a = {} for i=1,#k do table.insert(a, string.sub(k, i, i)) end return io.read(table.unpack(a)) end end})\nlocal A, B, C = read.nnn()\nlocal m = math.max(A,B,C)\nlocal s = A+B+C\ns = s - m + m*10\nprint(s)\n", "language": "Lua", "metadata": {"date": 1566052118, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s218620640.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218620640", "user_id": "u162773977"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local read = setmetatable({}, {__index = function(t, k) return function() local a = {} for i=1,#k do table.insert(a, string.sub(k, i, i)) end return io.read(table.unpack(a)) end end})\nlocal A, B, C = read.nnn()\nlocal m = math.max(A,B,C)\nlocal s = A+B+C\ns = s - m + m*10\nprint(s)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 279, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s466521671", "group_id": "codeNet:p03250", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif b <= a and c <= a then\n  print(a * 10 + b + c)\nelseif a <= b and c <= b then\n  print(b * 10 + a + c)\nelse\n  print(c * 10 + a + b)\nend\n", "language": "Lua", "metadata": {"date": 1559518347, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s466521671.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466521671", "user_id": "u120582723"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif b <= a and c <= a then\n  print(a * 10 + b + c)\nelseif a <= b and c <= b then\n  print(b * 10 + a + c)\nelse\n  print(c * 10 + a + b)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s897660084", "group_id": "codeNet:p03250", "input_text": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif b < a and c < a then\n  print(a * 10 + b + c)\nelseif a < b and c < b then\n  print(b * 10 + a + c)\nelse\n  print(c * 10 + a + b)\nend\n", "language": "Lua", "metadata": {"date": 1559518255, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s897660084.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s897660084", "user_id": "u120582723"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a, b, c = io.read(\"*n\", \"*n\", \"*n\")\nif b < a and c < a then\n  print(a * 10 + b + c)\nelseif a < b and c < b then\n  print(b * 10 + a + c)\nelse\n  print(c * 10 + a + b)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s376918441", "group_id": "codeNet:p03250", "input_text": "t={}\nfor i in io.read():gmatch(\"%d+\")do\n  table.insert(t,math.floor(i*1))\nend\ntable.sort(t)\nprint(t[1]+t[2]+10*t[3])", "language": "Lua", "metadata": {"date": 1551994268, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s376918441.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s376918441", "user_id": "u837412668"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "t={}\nfor i in io.read():gmatch(\"%d+\")do\n  table.insert(t,math.floor(i*1))\nend\ntable.sort(t)\nprint(t[1]+t[2]+10*t[3])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s309634611", "group_id": "codeNet:p03250", "input_text": "t={}\nfor i=1,3 do \n  t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[1]+t[2]+10*t[3])", "language": "Lua", "metadata": {"date": 1550174537, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s309634611.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s309634611", "user_id": "u015229643"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "t={}\nfor i=1,3 do \n  t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(t[1]+t[2]+10*t[3])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s991426656", "group_id": "codeNet:p03250", "input_text": "t={}\nfor i=1,3 do \n  t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(10*t[1]+t[2]+t[3])", "language": "Lua", "metadata": {"date": 1550173810, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s991426656.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s991426656", "user_id": "u015229643"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "t={}\nfor i=1,3 do \n  t[i]=io.read(\"n\")\nend\ntable.sort(t)\nprint(10*t[1]+t[2]+t[3])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 10, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s759615186", "group_id": "codeNet:p03250", "input_text": "a={io.read(\"n\"),io.read(\"n\"),io.read(\"n\")}\ntable.sort(a)\nprint(a[1]+a[2]+10*a[3])", "language": "Lua", "metadata": {"date": 1547756616, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s759615186.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759615186", "user_id": "u837412668"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "a={io.read(\"n\"),io.read(\"n\"),io.read(\"n\")}\ntable.sort(a)\nprint(a[1]+a[2]+10*a[3])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s991171719", "group_id": "codeNet:p03250", "input_text": "a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\");\na = tonumber(a)\nb = tonumber(b)\nc = tonumber(c)\nmax = math.max(a, b, c)\nprint(max*9+a+b+c)", "language": "Lua", "metadata": {"date": 1546390262, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s991171719.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991171719", "user_id": "u808916291"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\");\na = tonumber(a)\nb = tonumber(b)\nc = tonumber(c)\nmax = math.max(a, b, c)\nprint(max*9+a+b+c)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s018438189", "group_id": "codeNet:p03250", "input_text": "a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\");\nmax = math.max(a, b, c)\nprint(max*9+a+b+c)", "language": "Lua", "metadata": {"date": 1546389731, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s018438189.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s018438189", "user_id": "u808916291"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "a, b, c = string.match(io.read(), \"(%d+) (%d+) (%d+)\");\nmax = math.max(a, b, c)\nprint(max*9+a+b+c)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s385289617", "group_id": "codeNet:p03250", "input_text": "line = io.read()\nt={}\nstring.gsub(line,\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\ntable.sort(t)\nprint(t[1]+t[2]+t[3]*10)", "language": "Lua", "metadata": {"date": 1544466417, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s385289617.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s385289617", "user_id": "u030685402"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "line = io.read()\nt={}\nstring.gsub(line,\"(%S+)\", function (v) table.insert(t,tonumber(v)) end)\ntable.sort(t)\nprint(t[1]+t[2]+t[3]*10)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s056559585", "group_id": "codeNet:p03250", "input_text": "local A = io.read(\"*number\")\nlocal B = io.read(\"*number\")\nlocal C = io.read(\"*number\")\n\nlocal tb = {A, B, C}\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "language": "Lua", "metadata": {"date": 1542992791, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s056559585.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056559585", "user_id": "u089230684"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local A = io.read(\"*number\")\nlocal B = io.read(\"*number\")\nlocal C = io.read(\"*number\")\n\nlocal tb = {A, B, C}\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s097780648", "group_id": "codeNet:p03250", "input_text": " a = io.read(\"*number\")\n b = io.read(\"*number\")\n c = io.read(\"*number\")\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "language": "Lua", "metadata": {"date": 1542992686, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s097780648.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s097780648", "user_id": "u018679195"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": " a = io.read(\"*number\")\n b = io.read(\"*number\")\n c = io.read(\"*number\")\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s739385169", "group_id": "codeNet:p03250", "input_text": " s = io.read(\"*n\")\n a = string.sub(s,1,1)\n b = string.sub(s,2,2)\n c = string.sub(s,3,3)\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "language": "Lua", "metadata": {"date": 1542992523, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s739385169.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s739385169", "user_id": "u816631826"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": " s = io.read(\"*n\")\n a = string.sub(s,1,1)\n b = string.sub(s,2,2)\n c = string.sub(s,3,3)\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s960372323", "group_id": "codeNet:p03250", "input_text": " a = file:read()\n b = file:read()\n c = file:read()\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "language": "Lua", "metadata": {"date": 1542992424, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s960372323.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s960372323", "user_id": "u089230684"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": " a = file:read()\n b = file:read()\n c = file:read()\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s112663496", "group_id": "codeNet:p03250", "input_text": " a = io.read()\n b = io.read()\n c = io.read()\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "language": "Lua", "metadata": {"date": 1542992246, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s112663496.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s112663496", "user_id": "u816631826"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": " a = io.read()\n b = io.read()\n c = io.read()\n\nlocal max = math.max(a,b,c)\n\nprint(max*9+a+b+c)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s125216062", "group_id": "codeNet:p03250", "input_text": "local tb = {}\n\nlocal str = io.read()\n\nfor w in string.gmatch(str, \"%d+\") do\n\ttable.insert(tb, w)\nend\n\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "language": "Lua", "metadata": {"date": 1542991976, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s125216062.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s125216062", "user_id": "u816631826"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local tb = {}\n\nlocal str = io.read()\n\nfor w in string.gmatch(str, \"%d+\") do\n\ttable.insert(tb, w)\nend\n\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s079059366", "group_id": "codeNet:p03250", "input_text": "local tb = {}\n\nlocal str = io.read(\"*n\")\n\nfor w in string.gmatch(str, \"%d+\") do\n\ttable.insert(tb, w)\nend\n\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "language": "Lua", "metadata": {"date": 1542991537, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s079059366.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s079059366", "user_id": "u089230684"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local tb = {}\n\nlocal str = io.read(\"*n\")\n\nfor w in string.gmatch(str, \"%d+\") do\n\ttable.insert(tb, w)\nend\n\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 170, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s207620301", "group_id": "codeNet:p03250", "input_text": "local A = io.read()\nlocal B = io.read()\nlocal C = io.read()\n\nlocal tb = {A, B, C}\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "language": "Lua", "metadata": {"date": 1542991494, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s207620301.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s207620301", "user_id": "u816631826"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local A = io.read()\nlocal B = io.read()\nlocal C = io.read()\n\nlocal tb = {A, B, C}\ntable.sort(tb)\n\nlocal num = tb[3]*10 + tb[2] + tb[1]\n\nprint(num)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s101532458", "group_id": "codeNet:p03250", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nfunction test(a,b,c)\n    local num1 = a*10 +b+c\n    local num2 = a+b*10+c\n    local num3 = c*10+a+b\n    print(math.max(num1,num2,num3))\nend\ntest(a,b,c)", "language": "Lua", "metadata": {"date": 1542990933, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s101532458.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s101532458", "user_id": "u018679195"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nfunction test(a,b,c)\n    local num1 = a*10 +b+c\n    local num2 = a+b*10+c\n    local num3 = c*10+a+b\n    print(math.max(num1,num2,num3))\nend\ntest(a,b,c)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s848959653", "group_id": "codeNet:p03250", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\n\nlocal tbl = {a, b, c}\ntable.sort(tbl, function(a, b)\n\treturn a > b\nend)\n\nprint (tbl[1] * 10 + tbl[2] + tbl[3])", "language": "Lua", "metadata": {"date": 1542990746, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s848959653.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848959653", "user_id": "u018679195"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\n\nlocal tbl = {a, b, c}\ntable.sort(tbl, function(a, b)\n\treturn a > b\nend)\n\nprint (tbl[1] * 10 + tbl[2] + tbl[3])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s962736187", "group_id": "codeNet:p03250", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\n\nlocal d = math.max(a, b)\nlocal e = 0\nlocal f = 0\nif d == a then\n    e = math.max(b, c)\n    f = math.min(b, c)\nelse\n     e = math.max(a, c)\n    f = math.min(a, c)\nend\nlocal aa = math.max(d, e)\nlocal bb = math.min(d, e)\nlocal sum = aa*10 + bb + f\nprint(sum)\n\n", "language": "Lua", "metadata": {"date": 1542990040, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s962736187.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962736187", "user_id": "u353919145"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\n\nlocal d = math.max(a, b)\nlocal e = 0\nlocal f = 0\nif d == a then\n    e = math.max(b, c)\n    f = math.min(b, c)\nelse\n     e = math.max(a, c)\n    f = math.min(a, c)\nend\nlocal aa = math.max(d, e)\nlocal bb = math.min(d, e)\nlocal sum = aa*10 + bb + f\nprint(sum)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s172917948", "group_id": "codeNet:p03250", "input_text": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\n\nif a > b then\n\ta,b = b,a\nend\nif b > c then\n\tb,c = c,b\nend\nprint(c*10+b+a)", "language": "Lua", "metadata": {"date": 1542989830, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s172917948.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s172917948", "user_id": "u816631826"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\n\nif a > b then\n\ta,b = b,a\nend\nif b > c then\n\tb,c = c,b\nend\nprint(c*10+b+a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s305204537", "group_id": "codeNet:p03250", "input_text": "\na = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\n\nif a > b then\n\ta,b = b,a\nend\nif b > c then\n\tb,c = c,b\nend\nprint(a*10+b+c)", "language": "Lua", "metadata": {"date": 1542989787, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s305204537.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s305204537", "user_id": "u353919145"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "\na = io.read(\"*n\")\nb = io.read(\"*n\")\nc = io.read(\"*n\")\n\nif a > b then\n\ta,b = b,a\nend\nif b > c then\n\tb,c = c,b\nend\nprint(a*10+b+c)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s833094111", "group_id": "codeNet:p03250", "input_text": " a = io.read()\n b = io.read()\n c = io.read()\n\nif a>=b and a>=c then\n\tprint(a*10+b+c)\nelseif b>=a and b>=c then\n\tprint(b*10+a+c)\nelse\n\tprint(c*10+a+b)\nend\n", "language": "Lua", "metadata": {"date": 1542989263, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s833094111.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s833094111", "user_id": "u018679195"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": " a = io.read()\n b = io.read()\n c = io.read()\n\nif a>=b and a>=c then\n\tprint(a*10+b+c)\nelseif b>=a and b>=c then\n\tprint(b*10+a+c)\nelse\n\tprint(c*10+a+b)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s598609990", "group_id": "codeNet:p03250", "input_text": "local a = io.read()\nlocal b = io.read()\nlocal c = io.read()\n\nif a>=b and a>=c then\n\tprint(a*10+b+c)\nelseif b>=a and b>=c then\n\tprint(b*10+a+c)\nelse\n\tprint(c*10+a+b)\nend\n", "language": "Lua", "metadata": {"date": 1542989175, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s598609990.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s598609990", "user_id": "u863370423"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a = io.read()\nlocal b = io.read()\nlocal c = io.read()\n\nif a>=b and a>=c then\n\tprint(a*10+b+c)\nelseif b>=a and b>=c then\n\tprint(b*10+a+c)\nelse\n\tprint(c*10+a+b)\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s913360323", "group_id": "codeNet:p03250", "input_text": "input = {}\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n  table.insert(input, tonumber(v))\nend\ntable.sort(input)\nprint(input[1]+input[2]+input[3]*10)\n", "language": "Lua", "metadata": {"date": 1537752247, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s913360323.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s913360323", "user_id": "u374892957"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "input = {}\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n  table.insert(input, tonumber(v))\nend\ntable.sort(input)\nprint(input[1]+input[2]+input[3]*10)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s156316475", "group_id": "codeNet:p03250", "input_text": "local a = table.pack(string.match(io.read(), \"(%d+) (%d+) (%d+)\"))\ntable.sort(a)\n\nprint(tonumber(a[3]) * 10 + tonumber(a[2]) + tonumber(a[1]))", "language": "Lua", "metadata": {"date": 1537751918, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lua/s156316475.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156316475", "user_id": "u061001716"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "local a = table.pack(string.match(io.read(), \"(%d+) (%d+) (%d+)\"))\ntable.sort(a)\n\nprint(tonumber(a[3]) * 10 + tonumber(a[2]) + tonumber(a[1]))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 48, "memory_kb": 1132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s213010587", "group_id": "codeNet:p03251", "input_text": "n, m = io.read(\"*n\", \"*n\")\nx = {}\nx[1] = io.read(\"*n\")\ny = {}\ny[1] = io.read(\"*n\")\nfor i = 1, n do\n  x[i + 1] = io.read(\"*n\")\nend\nfor i = 1, m do\n  y[i + 1] = io.read(\"*n\")\nend\ntable.sort(x)\ntable.sort(y)\nf = y[1] <= x[#x]\nprint(f and \"War\" or \"No War\")\n", "language": "Lua", "metadata": {"date": 1595167210, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s213010587.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s213010587", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n, m = io.read(\"*n\", \"*n\")\nx = {}\nx[1] = io.read(\"*n\")\ny = {}\ny[1] = io.read(\"*n\")\nfor i = 1, n do\n  x[i + 1] = io.read(\"*n\")\nend\nfor i = 1, m do\n  y[i + 1] = io.read(\"*n\")\nend\ntable.sort(x)\ntable.sort(y)\nf = y[1] <= x[#x]\nprint(f and \"War\" or \"No War\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 254, "cpu_time_ms": 7, "memory_kb": 2684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s894651660", "group_id": "codeNet:p03251", "input_text": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x+1]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y+1]=Y table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1584231948, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s894651660.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894651660", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x+1]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y+1]=Y table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s351689976", "group_id": "codeNet:p03251", "input_text": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y]=Y table.sort(y)\nif x[#x+1] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1584230666, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s351689976.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s351689976", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y]=Y table.sort(y)\nif x[#x+1] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s276775360", "group_id": "codeNet:p03251", "input_text": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y]=Y table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1584229896, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s276775360.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s276775360", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end x[#x]=X table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end y[#y]=Y table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s387652217", "group_id": "codeNet:p03251", "input_text": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1584229787, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s387652217.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s387652217", "user_id": "u162773977"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N, M, X, Y = io.read(\"n\", \"n\", \"n\", \"n\")\nlocal x = {} for i=1,N do x[i]=io.read(\"n\") end table.sort(x)\nlocal y = {} for i=1,M do y[i]=io.read(\"n\") end table.sort(y)\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s876868537", "group_id": "codeNet:p03251", "input_text": "local mma, mmi = math.max, math.min\nlocal ior = io.input()\nlocal n, m, x, y = ior:read(\"*n\", \"*n\", \"*n\", \"*n\")\nlocal xmax = -100\nlocal ymin = 100\nfor i = 1, n do\n  local a = ior:read(\"*n\")\n  xmax = mma(xmax, a)\nend\nfor i = 1, m do\n  local a = ior:read(\"*n\")\n  ymin = mmi(ymin, a)\nend\nif ymin <= xmax then\n  print(\"War\")\nelse\n  local found = false\n  for z = xmax + 1, ymin do\n    if x < z and z <= y then\n      found = true\n      break\n    end\n  end\n  print(found and \"No War\" or \"War\")\nend\n", "language": "Lua", "metadata": {"date": 1559518148, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s876868537.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876868537", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local mma, mmi = math.max, math.min\nlocal ior = io.input()\nlocal n, m, x, y = ior:read(\"*n\", \"*n\", \"*n\", \"*n\")\nlocal xmax = -100\nlocal ymin = 100\nfor i = 1, n do\n  local a = ior:read(\"*n\")\n  xmax = mma(xmax, a)\nend\nfor i = 1, m do\n  local a = ior:read(\"*n\")\n  ymin = mmi(ymin, a)\nend\nif ymin <= xmax then\n  print(\"War\")\nelse\n  local found = false\n  for z = xmax + 1, ymin do\n    if x < z and z <= y then\n      found = true\n      break\n    end\n  end\n  print(found and \"No War\" or \"War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s553574469", "group_id": "codeNet:p03251", "input_text": "N=io.read(\"n\")\nM=io.read(\"n\")\nX=io.read(\"n\")\nY=io.read(\"n\")\nx={}\ny={}\nfor i=1,N do \n  x[i]=io.read(\"n\")\nend\nfor i=1,M do \n  y[i]=io.read(\"n\")\nend\ntable.insert(x,X)\ntable.insert(y,Y)\ntable.sort(x)\ntable.sort(y)\nif y[1]-x[#x]>=1 then\n  print(\"No War\")\n  else \n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1550176055, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s553574469.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553574469", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N=io.read(\"n\")\nM=io.read(\"n\")\nX=io.read(\"n\")\nY=io.read(\"n\")\nx={}\ny={}\nfor i=1,N do \n  x[i]=io.read(\"n\")\nend\nfor i=1,M do \n  y[i]=io.read(\"n\")\nend\ntable.insert(x,X)\ntable.insert(y,Y)\ntable.sort(x)\ntable.sort(y)\nif y[1]-x[#x]>=1 then\n  print(\"No War\")\n  else \n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s714167852", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\n\nfor i=1,n do\n\tif x<a[i] then x = a[i] end\nend\n\nfor i=1,m do\n\tif y > b[i] then y = b[i] end\nend\n\n\nif x<y then print(\"no War\") else print(\"War\") end\n", "language": "Lua", "metadata": {"date": 1542994242, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s714167852.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s714167852", "user_id": "u863370423"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\n\nfor i=1,n do\n\tif x<a[i] then x = a[i] end\nend\n\nfor i=1,m do\n\tif y > b[i] then y = b[i] end\nend\n\n\nif x<y then print(\"no War\") else print(\"War\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s184827366", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\n\nfor i=1,n do\n\tif x<a[i] then x = a[i] end\nend\n\nfor i=1,m do\n\tif y > b[i] then y = b[i] end\nend\n\n\nif x<y then print(\"War\") else print(\"No War\") end", "language": "Lua", "metadata": {"date": 1542994182, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s184827366.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s184827366", "user_id": "u863370423"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\n\nfor i=1,n do\n\tif x<a[i] then x = a[i] end\nend\n\nfor i=1,m do\n\tif y > b[i] then y = b[i] end\nend\n\n\nif x<y then print(\"War\") else print(\"No War\") end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s544458723", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "language": "Lua", "metadata": {"date": 1542994047, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s544458723.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s544458723", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\tb[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s664606716", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read()\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "language": "Lua", "metadata": {"date": 1542993978, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s664606716.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s664606716", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read()\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s033865690", "group_id": "codeNet:p03251", "input_text": "local N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z > X and Z <= Y then return true end\n\tend\n\treturn false\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)", "language": "Lua", "metadata": {"date": 1542993800, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s033865690.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s033865690", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z > X and Z <= Y then return true end\n\tend\n\treturn false\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 543, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s760881215", "group_id": "codeNet:p03251", "input_text": "\nlocal N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z > X or Z <= Y then return true end\n\tend\n\treturn false\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)\n", "language": "Lua", "metadata": {"date": 1542993756, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s760881215.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s760881215", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "\nlocal N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z > X or Z <= Y then return true end\n\tend\n\treturn false\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s923145232", "group_id": "codeNet:p03251", "input_text": "local N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z <= X or Z > Y then return false end\n\tend\n\treturn true\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)", "language": "Lua", "metadata": {"date": 1542993697, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s923145232.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s923145232", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N = io.read(\"*number\")\nlocal M = io.read(\"*number\")\nlocal X = io.read(\"*number\")\nlocal Y = io.read(\"*number\")\n\nlocal tb1 = {}\nfor i=1, N do\n\ttb1[i] = io.read(\"*number\")\nend\ntable.sort(tb1)\nlocal tb2 = {}\nfor i=1, M do\n\ttb2[i] = io.read(\"*number\")\nend\ntable.sort(tb2)\n\nlocal function check()\n\tlocal x = tb1[#tb1]\n\tlocal y = tb2[1]\n\tlocal n = y - x\n\tif n < 0 then return false end\n\tfor i=1, n do\n\t\tlocal Z = x + n\n\t\tif Z <= X or Z > Y then return false end\n\tend\n\treturn true\nend\nlocal result = check() and \"No War\" or \"War\"\n\nprint(result)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s422396312", "group_id": "codeNet:p03251", "input_text": "local s = io.read()\nlocal n = string.sub(s,1,1)\nlocal m = string.sub(s,2,2)\nlocal x = string.sub(s,3,3)\nlocal y = string.sub(s,4,4)\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "language": "Lua", "metadata": {"date": 1542993683, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s422396312.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s422396312", "user_id": "u089230684"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local s = io.read()\nlocal n = string.sub(s,1,1)\nlocal m = string.sub(s,2,2)\nlocal x = string.sub(s,3,3)\nlocal y = string.sub(s,4,4)\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s919003020", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end", "language": "Lua", "metadata": {"date": 1542992850, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s919003020.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s919003020", "user_id": "u089230684"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal m = io.read(\"*number\")\nlocal x = io.read(\"*number\")\nlocal y = io.read(\"*number\")\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read(\"*number\")\nend\n\nfor j=1,m do\n\ta[j] = io.read(\"*number\")\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s414275649", "group_id": "codeNet:p03251", "input_text": "local N,M,X,Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal cityN = {}\nlocal cityM = {}\nfor i=1,N do\n    table.insert(cityN,io.read(\"*n\"))\nend\nfor i=1,M do\n    table.insert(cityM,io.read(\"*n\"))\nend\n\nfunction test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "language": "Lua", "metadata": {"date": 1542992136, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s414275649.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414275649", "user_id": "u089230684"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N,M,X,Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal cityN = {}\nlocal cityM = {}\nfor i=1,N do\n    table.insert(cityN,io.read(\"*n\"))\nend\nfor i=1,M do\n    table.insert(cityM,io.read(\"*n\"))\nend\n\nfunction test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 605, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s999223484", "group_id": "codeNet:p03251", "input_text": "local N,M,X,Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal cityN = {}\nlocal cityM = {}\nfor i=1,N do\n    table.insert(cityN,io.read(\"*n\"))\nend\nfor i=1,M do\n    table.insert(cityM,io.read(\"*n\"))\nend\n\nfunction test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    print(minN,maxN,minM,maxM)\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "language": "Lua", "metadata": {"date": 1542992066, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s999223484.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s999223484", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N,M,X,Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nlocal cityN = {}\nlocal cityM = {}\nfor i=1,N do\n    table.insert(cityN,io.read(\"*n\"))\nend\nfor i=1,M do\n    table.insert(cityM,io.read(\"*n\"))\nend\n\nfunction test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    print(minN,maxN,minM,maxM)\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 636, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s797809257", "group_id": "codeNet:p03251", "input_text": "function test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    print(minN,maxN,minM,maxM)\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "language": "Lua", "metadata": {"date": 1542992045, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s797809257.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s797809257", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "function test(X,Y,cityN,cityM)\n    local minN,maxN = X,X\n    for i,v in ipairs(cityN) do\n        minN = math.min(v,minN)\n        maxN = math.max(v,maxN)\n    end\n    local minM,maxM = Y,Y\n    for i,v in ipairs(cityM) do\n        minM = math.min(v,minM)\n        maxM = math.max(v,maxM)\n    end\n    print(minN,maxN,minM,maxM)\n    if minM>maxN or minN >maxM then\n        print(\"No War\")\n    else\n        print(\"War\")\n    end\nend\n\ntest(X,Y,cityN,cityM)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 446, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s890174353", "group_id": "codeNet:p03251", "input_text": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\nlocal endend = false\nfor i = 1, N do\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\n\tif ymin <= xmax then\n\t\tendend = true\n\t\tbreak\n\tend\nend\nif not endend then\n\tfor i = 1, M do\n\t\tlocal yi = io.read(\"*n\")\n\t\tymin = math.min(ymin, yi)\n\t\tif ymin <= xmax then\n\t\t\tendend = true\n\t\t\tbreak\n\t\tend\n\tend\nend\nif endend then\n\tprint(\"War\")\nelse\n\tprint(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1542991770, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s890174353.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890174353", "user_id": "u863370423"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\nlocal endend = false\nfor i = 1, N do\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\n\tif ymin <= xmax then\n\t\tendend = true\n\t\tbreak\n\tend\nend\nif not endend then\n\tfor i = 1, M do\n\t\tlocal yi = io.read(\"*n\")\n\t\tymin = math.min(ymin, yi)\n\t\tif ymin <= xmax then\n\t\t\tendend = true\n\t\t\tbreak\n\t\tend\n\tend\nend\nif endend then\n\tprint(\"War\")\nelse\n\tprint(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 8, "memory_kb": 1012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s655939667", "group_id": "codeNet:p03251", "input_text": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\nlocal endend = false\nfor i = 1, N do\n\tif ymin <= xmax then\n\t\tendend = true\n\t\tbreak\n\tend\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\nend\nif not endend then\n\tfor i = 1, M do\n\t\tif ymin <= xmax then\n\t\t\tendend = true\n\t\t\tbreak\n\t\tend\n\t\tlocal yi = io.read(\"*n\")\n\t\tymin = math.min(ymin, yi)\n\tend\nend\nif endend then\n\tprint(\"War\")\nelse\n\tprint(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1542991654, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s655939667.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s655939667", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\nlocal endend = false\nfor i = 1, N do\n\tif ymin <= xmax then\n\t\tendend = true\n\t\tbreak\n\tend\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\nend\nif not endend then\n\tfor i = 1, M do\n\t\tif ymin <= xmax then\n\t\t\tendend = true\n\t\t\tbreak\n\t\tend\n\t\tlocal yi = io.read(\"*n\")\n\t\tymin = math.min(ymin, yi)\n\tend\nend\nif endend then\n\tprint(\"War\")\nelse\n\tprint(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s720058708", "group_id": "codeNet:p03251", "input_text": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\n\nfor i = 1, N do\n\tif ymin <= xmax then\n\t\tprint(\"War\")\n\t\treturn\n\tend\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\nend\nfor i = 1, M do\n\tif ymin <= xmax then\n\t\tprint(\"War\")\n\t\treturn\n\tend\n\tlocal yi = io.read(\"*n\")\n\tymin = math.min(ymin, yi)\nend\nprint(\"No War\")", "language": "Lua", "metadata": {"date": 1542991423, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s720058708.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s720058708", "user_id": "u863370423"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local N = io.read(\"*n\")\nlocal M = io.read(\"*n\")\nlocal X = io.read(\"*n\")\nlocal Y = io.read(\"*n\")\n\nlocal xmax = X\nlocal ymin = Y\n\nfor i = 1, N do\n\tif ymin <= xmax then\n\t\tprint(\"War\")\n\t\treturn\n\tend\n\tlocal xi = io.read(\"*n\")\n\txmax = math.max(xmax, xi)\nend\nfor i = 1, M do\n\tif ymin <= xmax then\n\t\tprint(\"War\")\n\t\treturn\n\tend\n\tlocal yi = io.read(\"*n\")\n\tymin = math.min(ymin, yi)\nend\nprint(\"No War\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 391, "cpu_time_ms": 10, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s667545458", "group_id": "codeNet:p03251", "input_text": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\txx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = xx\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\txx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)\n", "language": "Lua", "metadata": {"date": 1542991160, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s667545458.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s667545458", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\txx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = xx\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\txx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s959033972", "group_id": "codeNet:p03251", "input_text": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\txx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\txx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "language": "Lua", "metadata": {"date": 1542991111, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s959033972.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s959033972", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\txx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\txx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 355, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s647065047", "group_id": "codeNet:p03251", "input_text": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "language": "Lua", "metadata": {"date": 1542991096, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s647065047.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s647065047", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or xx > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or xx < b then\n\t\tb = xx\n\tend\nend\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 6, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s962618885", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*n\")\nlocal m = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal y = io.read(\"*n\")\nlocal xt = {}\nlocal yt = {}\nfor i = 1, n do\n    table.insert(xt, io.read(\"*n\"))\nend\n\nfor i = 1, m do\n    table.insert(yt, io.read(\"*n\"))\nend\ntable.sort(xt, function(a, b)\n    return a > b\nend)\ntable.sort(yt, function(a, b)\n    return a < b\nend)\nlocal maxX = math.max(xt[1], x)\nlocal minY = math.min(yt[1], y)\nif maxX >= minY then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1542990945, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s962618885.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962618885", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal m = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal y = io.read(\"*n\")\nlocal xt = {}\nlocal yt = {}\nfor i = 1, n do\n    table.insert(xt, io.read(\"*n\"))\nend\n\nfor i = 1, m do\n    table.insert(yt, io.read(\"*n\"))\nend\ntable.sort(xt, function(a, b)\n    return a > b\nend)\ntable.sort(yt, function(a, b)\n    return a < b\nend)\nlocal maxX = math.max(xt[1], x)\nlocal minY = math.min(yt[1], y)\nif maxX >= minY then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 471, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s351965260", "group_id": "codeNet:p03251", "input_text": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or x < b then\n\t\tb = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "language": "Lua", "metadata": {"date": 1542990852, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s351965260.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s351965260", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or x < b then\n\t\tb = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = x+1, y do\n\tif i > a and i <= b then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s890994239", "group_id": "codeNet:p03251", "input_text": "local n = io.read(\"*n\")\nlocal m = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal y = io.read(\"*n\")\nlocal xt = {}\nlocal yt = {}\nfor i = 1, n do\n    table.insert(xt, io.read(\"*n\"))\nend\n\nfor i = 1, m do\n    table.insert(yt, io.read(\"*n\"))\nend\ntable.sort(xt, function(a, b)\n    return a > b\nend)\ntable.sort(yt, function(a, b)\n    return a < b\nend)\nlocal maxX = math.max(xt[1], x)\nlocal minY = math.min(yt[1], y)\nif maxX > minY then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1542990774, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s890994239.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s890994239", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal m = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal y = io.read(\"*n\")\nlocal xt = {}\nlocal yt = {}\nfor i = 1, n do\n    table.insert(xt, io.read(\"*n\"))\nend\n\nfor i = 1, m do\n    table.insert(yt, io.read(\"*n\"))\nend\ntable.sort(xt, function(a, b)\n    return a > b\nend)\ntable.sort(yt, function(a, b)\n    return a < b\nend)\nlocal maxX = math.max(xt[1], x)\nlocal minY = math.min(yt[1], y)\nif maxX > minY then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s239920099", "group_id": "codeNet:p03251", "input_text": "\nn = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or x < b then\n\t\tb = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = a+1, b do\n\tif i > x and i >= y then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "language": "Lua", "metadata": {"date": 1542990706, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s239920099.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s239920099", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "\nn = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not b or x < b then\n\t\tb = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = a+1, b do\n\tif i > x and i >= y then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s151773437", "group_id": "codeNet:p03251", "input_text": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not a or x < a then\n\t\ta = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = a+1, b do\n\tif i > x and i >= y then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "language": "Lua", "metadata": {"date": 1542990393, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s151773437.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s151773437", "user_id": "u089230684"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "n = io.read(\"*n\")\nm = io.read(\"*n\")\nx = io.read(\"*n\")\ny = io.read(\"*n\")\n\nlocal a = nil\nfor i = 1, n do\n\tx = io.read(\"*n\")\n\tif not a or x > a then\n\t\ta = x\n\tend\nend\nlocal b = nil\nfor i = 1, m do\n\tx = io.read(\"*n\")\n\tif not a or x < a then\n\t\ta = x\n\tend\nend\n\nlocal war = \"War\"\nfor i = a+1, b do\n\tif i > x and i >= y then\n\t\twar = \"No War\"\n\tend\nend\nprint(war)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s352618915", "group_id": "codeNet:p03251", "input_text": "local n = io.read()\nlocal m = io.read()\nlocal x = io.read()\nlocal y = io.read()\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read()\nend\n\nfor j=1,m do\n\ta[j] = io.read()\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end", "language": "Lua", "metadata": {"date": 1542989764, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s352618915.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s352618915", "user_id": "u089230684"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n = io.read()\nlocal m = io.read()\nlocal x = io.read()\nlocal y = io.read()\nlocal a = {}\nlocal b = {}\n\nfor i=1,n do\n\ta[i] = io.read()\nend\n\nfor j=1,m do\n\ta[j] = io.read()\nend\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,m-1 do\n\tfor j=i+1,m do\n\t\tif b[i]>b[j] then\n\t\t\tb[i],b[j] = b[j],b[i]\n\t\tend\n\tend\nend\n\nif x<a[1] then x=a[1] end\nif y>b[1] then y=b[1] end\n\nif x<y then print(\"War\") else print(\"No War\") end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s234141212", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\n\nif math.max(table.unpack(x)) < math.min(table.unpack(y)) then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1537812935, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s234141212.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s234141212", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\n\nif math.max(table.unpack(x)) < math.min(table.unpack(y)) then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s640509332", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.insert(x,X)\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.insert(y,Y)\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "language": "Lua", "metadata": {"date": 1537809068, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s640509332.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s640509332", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.insert(x,X)\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.insert(y,Y)\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 356, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s239769537", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "language": "Lua", "metadata": {"date": 1537808959, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s239769537.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s239769537", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = io.read(\"*n\",\"*n\",\"*n\",\"*n\")\nio.read()\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 4, "memory_kb": 636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s960183519", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d+)\")\nx, y = {tonumber(X)}, {tonumber(Y)}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "language": "Lua", "metadata": {"date": 1537808831, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s960183519.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s960183519", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d+)\")\nx, y = {tonumber(X)}, {tonumber(Y)}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 4, "memory_kb": 636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s424235806", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {tonumber(X)}, {tonumber(Y)}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "language": "Lua", "metadata": {"date": 1537808712, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s424235806.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s424235806", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {tonumber(X)}, {tonumber(Y)}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s063323302", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "language": "Lua", "metadata": {"date": 1537755140, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s063323302.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s063323302", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] < y[1] then\n  print(\"No War\")\nelse\n  print(\"War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s934913702", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] >= y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1537754524, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s934913702.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s934913702", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] >= y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 4, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s399284631", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "language": "Lua", "metadata": {"date": 1537753747, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s399284631.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399284631", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {X}, {Y}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 38, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s830162180", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif math.max(x[#x],X) > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "language": "Lua", "metadata": {"date": 1537753497, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s830162180.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s830162180", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif math.max(x[#x],X) > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s377941374", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif max(x[#x],X) > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "language": "Lua", "metadata": {"date": 1537753459, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s377941374.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s377941374", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif max(x[#x],X) > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 51, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s560714549", "group_id": "codeNet:p03251", "input_text": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1537753206, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s560714549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s560714549", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "N, M, X, Y = string.gmatch(io.read(), \"(%d)\")\nx, y = {}, {}\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\ntable.sort(x)\n\nfor v in string.gmatch(io.read(),\"(%d+)\") do\n  table.insert(y, tonumber(v))\nend\ntable.sort(y)\n\nif x[#x] > y[1] then\n  print(\"War\")\nelse\n  print(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s127742626", "group_id": "codeNet:p03251", "input_text": "local n, m, x, y = string.match(io.read(), \"(%d+) (%d+) ([+-]?%d+) ([+-]?%d+)\")\nn, m = tonumber(n), tonumber(m)\nlocal xn = { tonumber(x) }\nlocal ym = { tonumber(y) }\n\nfor v in string.gmatch(io.read(), \"([+-]?%d+)\") do\n\ttable.insert(xn, tonumber(v))\nend\nfor v in string.gmatch(io.read(), \"([+-]?%d+)\") do\n\ttable.insert(ym, tonumber(v))\nend\n\ntable.sort(xn)\ntable.sort(ym)\n\nif(xn[#xn] >= ym[1]) then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "language": "Lua", "metadata": {"date": 1537752629, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lua/s127742626.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127742626", "user_id": "u061001716"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "local n, m, x, y = string.match(io.read(), \"(%d+) (%d+) ([+-]?%d+) ([+-]?%d+)\")\nn, m = tonumber(n), tonumber(m)\nlocal xn = { tonumber(x) }\nlocal ym = { tonumber(y) }\n\nfor v in string.gmatch(io.read(), \"([+-]?%d+)\") do\n\ttable.insert(xn, tonumber(v))\nend\nfor v in string.gmatch(io.read(), \"([+-]?%d+)\") do\n\ttable.insert(ym, tonumber(v))\nend\n\ntable.sort(xn)\ntable.sort(ym)\n\nif(xn[#xn] >= ym[1]) then\n    print(\"War\")\nelse\n    print(\"No War\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 56, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s729850364", "group_id": "codeNet:p03260", "input_text": "print(io.read():find(\"2\")and'No'or'Yes')", "language": "Lua", "metadata": {"date": 1566967834, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s729850364.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s729850364", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print(io.read():find(\"2\")and'No'or'Yes')", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s667074536", "group_id": "codeNet:p03260", "input_text": "a,b=io.read(\"*n\",\"*n\")\nprint((a*b)%2==1 and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1564023933, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s667074536.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s667074536", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b=io.read(\"*n\",\"*n\")\nprint((a*b)%2==1 and \"Yes\" or \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s681454798", "group_id": "codeNet:p03260", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"No\"or\"Yes\")", "language": "Lua", "metadata": {"date": 1551994072, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s681454798.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s681454798", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"No\"or\"Yes\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s956173974", "group_id": "codeNet:p03260", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"No\"or\"Yes\")", "language": "Lua", "metadata": {"date": 1551994045, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s956173974.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s956173974", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"No\"or\"Yes\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s771444248", "group_id": "codeNet:p03260", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nif (A*B)%2==1 then\n  print(\"Yes\")\n  else\n  print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1550191388, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s771444248.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771444248", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nif (A*B)%2==1 then\n  print(\"Yes\")\n  else\n  print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s873773853", "group_id": "codeNet:p03260", "input_text": "print(io.read(\"n\")*io.read(\"n\")%2==1 and \"Yes\" or \"No\")", "language": "Lua", "metadata": {"date": 1547756764, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s873773853.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873773853", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print(io.read(\"n\")*io.read(\"n\")%2==1 and \"Yes\" or \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s054377476", "group_id": "codeNet:p03260", "input_text": "local n = io.read(\"*n\")\nlocal str = {}\nfor i = 1, n do\n    print(io.read(\"l\"))\n    table.insert(str, io.read(\"l\"))\nend\nlocal firStr = str[1]\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal tab = {}\ntab[firStr] = 1\nlocal result = true\nfor i = 2,n do\n    local tStr = str[i]\n    local t = string.sub(tStr, 1, 1)\n    if t == endStr or tab[tStr] then\n        print(\"No\")\n        result = false\n        break\n    end\n    len = string.len(tStr)\n    endStr = string.sub(tStr, len, len)\nend\nif result then\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542942305, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s054377476.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s054377476", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal str = {}\nfor i = 1, n do\n    print(io.read(\"l\"))\n    table.insert(str, io.read(\"l\"))\nend\nlocal firStr = str[1]\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal tab = {}\ntab[firStr] = 1\nlocal result = true\nfor i = 2,n do\n    local tStr = str[i]\n    local t = string.sub(tStr, 1, 1)\n    if t == endStr or tab[tStr] then\n        print(\"No\")\n        result = false\n        break\n    end\n    len = string.len(tStr)\n    endStr = string.sub(tStr, len, len)\nend\nif result then\n    print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 4, "memory_kb": 504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s904591352", "group_id": "codeNet:p03260", "input_text": "local n = io.read(\"*n\")\nlocal str = {}\nfor i = 1, n do\n    table.insert(str, io.read(\"l\"))\nend\nlocal firStr = str[1]\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal tab = {}\ntab[firStr] = 1\nlocal result = true\nfor i = 2,n do\n    local tStr = str[i]\n    local t = string.sub(tStr, 1, 1)\n    if t == endStr or tab[tStr] then\n        print(\"No\")\n        result = false\n        break\n    end\n    len = string.len(tStr)\n    endStr = string.sub(tStr, len, len)\nend\nif result then\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542942021, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s904591352.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s904591352", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal str = {}\nfor i = 1, n do\n    table.insert(str, io.read(\"l\"))\nend\nlocal firStr = str[1]\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal tab = {}\ntab[firStr] = 1\nlocal result = true\nfor i = 2,n do\n    local tStr = str[i]\n    local t = string.sub(tStr, 1, 1)\n    if t == endStr or tab[tStr] then\n        print(\"No\")\n        result = false\n        break\n    end\n    len = string.len(tStr)\n    endStr = string.sub(tStr, len, len)\nend\nif result then\n    print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s264532825", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"Yes\"\n        end\n    end\n    return \"No\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542690476, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s264532825.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264532825", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"Yes\"\n        end\n    end\n    return \"No\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s284678729", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 1 then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1542690383, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s284678729.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284678729", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 1 then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s262329396", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 0 then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1542690322, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s262329396.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s262329396", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 0 then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s589182513", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "language": "Lua", "metadata": {"date": 1542690240, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s589182513.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s589182513", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nif (a*b) %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s693055623", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\nif (A*B) %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "language": "Lua", "metadata": {"date": 1542690182, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s693055623.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s693055623", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\nif (A*B) %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s119844137", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\nif A*B %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "language": "Lua", "metadata": {"date": 1542690131, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s119844137.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s119844137", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\nif A*B %2 == 1 then\n    print(\"YES\")\nelse\n    print(\"NO\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s028426572", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\n--local function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            print(\"YES\")\n        else\n            print(\"NO\")\n        end", "language": "Lua", "metadata": {"date": 1542690069, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s028426572.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s028426572", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\n--local function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            print(\"YES\")\n        else\n            print(\"NO\")\n        end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 258, "cpu_time_ms": 4, "memory_kb": 636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s086212141", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            print(\"YES\")\n        end\n    --end\n    print(\"NO\")\nend\ntest(A,B)", "language": "Lua", "metadata": {"date": 1542689948, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s086212141.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s086212141", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            print(\"YES\")\n        end\n    --end\n    print(\"NO\")\nend\ntest(A,B)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s150438825", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            return \"YES\"\n        end\n    --end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542689856, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s150438825.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150438825", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    --local newMin = math.min(A,B)\n    --local newMax = math.max(A,B)\n    --for i=newMin,newMax do\n        if A*B %2 == 1 then\n            return \"YES\"\n        end\n    --end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s925485844", "group_id": "codeNet:p03260", "input_text": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542689675, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s925485844.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s925485844", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A,B = io.read(\"*n\",\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s662785272", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    for i=1,3 do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542342880, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s662785272.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s662785272", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    for i=1,3 do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s969074866", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542342791, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s969074866.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s969074866", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 277, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s015353936", "group_id": "codeNet:p03260", "input_text": "a = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())\n", "language": "Lua", "metadata": {"date": 1542342589, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s015353936.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s015353936", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s991509172", "group_id": "codeNet:p03260", "input_text": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542342573, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s991509172.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s991509172", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s133583300", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*C %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542341976, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s133583300.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s133583300", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*C %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s401830735", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542341975, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s401830735.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s401830735", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s471478925", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nfunction odd(num)\n\tif num%2 == 0 then\n\t\treturn false\n\telse\n\t\treturn true\n\tend\nend\n\nif odd(a) and odd(b) then\n\tif math.abs(a - b) > 1 then\n\t\tprint(\"YES\")\n\telse\n\t\tprint(\"NO\")\n\tend\nelse\n\tprint(\"NO\")\nend", "language": "Lua", "metadata": {"date": 1542341969, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s471478925.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s471478925", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nfunction odd(num)\n\tif num%2 == 0 then\n\t\treturn false\n\telse\n\t\treturn true\n\tend\nend\n\nif odd(a) and odd(b) then\n\tif math.abs(a - b) > 1 then\n\t\tprint(\"YES\")\n\telse\n\t\tprint(\"NO\")\n\tend\nelse\n\tprint(\"NO\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s394524507", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    print(newMin,newMax)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542341436, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s394524507.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394524507", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    print(newMin,newMax)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s216542951", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "language": "Lua", "metadata": {"date": 1542341433, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s216542951.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s216542951", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*i %2 == 1 then\n            return \"YES\"\n        end\n    end\n    return \"NO\"\nend\nprint(test(A,B))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 277, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s896263338", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"NO\")\nelse\n    print(\"YES\")\nend", "language": "Lua", "metadata": {"date": 1542341419, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s896263338.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s896263338", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"NO\")\nelse\n    print(\"YES\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s409443284", "group_id": "codeNet:p03260", "input_text": "a=io.read()\nb=io.read()\n\nif a==2 or b==2 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542341417, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s409443284.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409443284", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a=io.read()\nb=io.read()\n\nif a==2 or b==2 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s941518625", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542341416, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s941518625.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s941518625", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"No\")\nelse\n    print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s128409522", "group_id": "codeNet:p03260", "input_text": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "language": "Lua", "metadata": {"date": 1542341410, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s128409522.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s128409522", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = io.read(\"*n\")\nb = io.read(\"*n\")\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s772524829", "group_id": "codeNet:p03260", "input_text": "a = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "language": "Lua", "metadata": {"date": 1542335162, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s772524829.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s772524829", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s210377718", "group_id": "codeNet:p03260", "input_text": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542335140, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s210377718.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s210377718", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s228990224", "group_id": "codeNet:p03260", "input_text": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542334989, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s228990224.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s228990224", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "a=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s909937562", "group_id": "codeNet:p03260", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"NO\")\nelse\n    print(\"YES\")\nend\n--#17024584 | luozeming's solution for [AtCoder-4250] [Problem A]", "language": "Lua", "metadata": {"date": 1542333240, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s909937562.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s909937562", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a%2 == 0 or b%2 == 0 or (a*b)%2 == 0 then\n    print(\"NO\")\nelse\n    print(\"YES\")\nend\n--#17024584 | luozeming's solution for [AtCoder-4250] [Problem A]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s091896545", "group_id": "codeNet:p03260", "input_text": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*C %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))\n--#17024498 | zhuhuiling's solution for [AtCoder-4250] [Problem A]", "language": "Lua", "metadata": {"date": 1542333073, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s091896545.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s091896545", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local A = io.read(\"*n\")\nlocal B = io.read(\"*n\")\nlocal function test(A,B)\n    local newMin = math.min(A,B)\n    local newMax = math.max(A,B)\n    for i=newMin,newMax do\n        if A*B*C %2 == 1 then\n            return YES\n        end\n    end\n    return NO\nend\nprint(test(A,B))\n--#17024498 | zhuhuiling's solution for [AtCoder-4250] [Problem A]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s134708910", "group_id": "codeNet:p03260", "input_text": "--#17024484 | zhangxudong's solution for [AtCoder-4250] [Problem A]\na = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "language": "Lua", "metadata": {"date": 1542332887, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s134708910.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s134708910", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "--#17024484 | zhangxudong's solution for [AtCoder-4250] [Problem A]\na = io.read()\nb = io.read()\nlocal function f()\n\tif a%2 == 0 or b%2 == 0 then\n\t\treturn \"No\"\n\tend\n\treturn \"Yes\"\nend\nprint(f())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s895840539", "group_id": "codeNet:p03260", "input_text": "--#17024479 | kachidoki's solution for [AtCoder-4250] [Problem A]\na=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542332701, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s895840539.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s895840539", "user_id": "u926674523"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "--#17024479 | kachidoki's solution for [AtCoder-4250] [Problem A]\na=io.read()\nb=io.read()\n\nif a*b%2 == 0 then\n   print(\"No\")\nelse\n   print(\"Yes\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s542503492", "group_id": "codeNet:p03260", "input_text": "A, B = io.read(\"*n\", \"*n\")\n\nif (A*B)%2 == 1 then\n  print(\"Yes\")\nelse\n  print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1536455010, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lua/s542503492.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s542503492", "user_id": "u374892957"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "A, B = io.read(\"*n\", \"*n\")\n\nif (A*B)%2 == 1 then\n  print(\"Yes\")\nelse\n  print(\"No\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 128, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s512320579", "group_id": "codeNet:p03261", "input_text": "N = io.read(\"*n\", \"*l\")\nW = {}\nfor i=1, N do\n    W[i]=io.read()\nend\n\nchecker = true\nfor i=1, N-1 do\n    if string.sub(W[i], -1, -1) ~= string.sub(W[i+1], 1, 1) then\n        checker = false\n    end\nend\n\ntable.sort(W)\nfor i=1, N-1 do\n    if W[i] == W[i+1] then\n        checker = false\n    end\nend\n\nif checker then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1587153011, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s512320579.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s512320579", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N = io.read(\"*n\", \"*l\")\nW = {}\nfor i=1, N do\n    W[i]=io.read()\nend\n\nchecker = true\nfor i=1, N-1 do\n    if string.sub(W[i], -1, -1) ~= string.sub(W[i+1], 1, 1) then\n        checker = false\n    end\nend\n\ntable.sort(W)\nfor i=1, N-1 do\n    if W[i] == W[i+1] then\n        checker = false\n    end\nend\n\nif checker then\n    print(\"Yes\")\nelse\n    print(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s727486577", "group_id": "codeNet:p03261", "input_text": "N = io.read(\"*n\")\nW1 = {}\nW2 = {}\nfor i=1, N do\n    w=io.read()\n    if W1[w] == nil then\n        W1[w] = 1\n    else\n        W1[w] = W1[w] + 1\n    end\n    W2[i] = w\nend\n\nfor key, _ in pairs(W1) do\n    if W1[key] ~= 1 then\n        print(\"No\")\n        return\n    end\nend\n\nfor i=1, N-1 do\n    if W2[i]:sub(#W2[i],#W2[i]) ~= W2[i+1]:sub(1,1) then\n        print(\"No\")\n        return\n    end\nend\n\nprint(\"Yes\")", "language": "Lua", "metadata": {"date": 1587150773, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s727486577.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s727486577", "user_id": "u045238009"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N = io.read(\"*n\")\nW1 = {}\nW2 = {}\nfor i=1, N do\n    w=io.read()\n    if W1[w] == nil then\n        W1[w] = 1\n    else\n        W1[w] = W1[w] + 1\n    end\n    W2[i] = w\nend\n\nfor key, _ in pairs(W1) do\n    if W1[key] ~= 1 then\n        print(\"No\")\n        return\n    end\nend\n\nfor i=1, N-1 do\n    if W2[i]:sub(#W2[i],#W2[i]) ~= W2[i+1]:sub(1,1) then\n        print(\"No\")\n        return\n    end\nend\n\nprint(\"Yes\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s670924633", "group_id": "codeNet:p03261", "input_text": "local n = io.read(\"*n\", \"*l\")\nlocal prev = io.read()\nlocal t = {}\nt[prev] = true\nlocal ret = true\nfor i = 2, n do\n  local str = io.read()\n  if t[str] then\n    ret = false\n  elseif prev:sub(#prev, #prev) ~= str:sub(1, 1) then\n    ret = false\n  else\n    t[str] = true\n    prev = str\n  end\nend\nprint(ret and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1565009529, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s670924633.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670924633", "user_id": "u120582723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read(\"*n\", \"*l\")\nlocal prev = io.read()\nlocal t = {}\nt[prev] = true\nlocal ret = true\nfor i = 2, n do\n  local str = io.read()\n  if t[str] then\n    ret = false\n  elseif prev:sub(#prev, #prev) ~= str:sub(1, 1) then\n    ret = false\n  else\n    t[str] = true\n    prev = str\n  end\nend\nprint(ret and \"Yes\" or \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s245852082", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n    break\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n    break\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550195197, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s245852082.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245852082", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n    break\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n    break\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s126836708", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=true\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=false\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=false\n  end\nend\nif res==true then\n  print(\"Yes\")\n  else \n  print(\"No\")\nend\n", "language": "Lua", "metadata": {"date": 1550194969, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s126836708.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s126836708", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=true\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=false\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=false\n  end\nend\nif res==true then\n  print(\"Yes\")\n  else \n  print(\"No\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s600081686", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550194874, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s600081686.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s600081686", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],-1,-1)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 10, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s736626631", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=tostring(io.read())\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550194051, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s736626631.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s736626631", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=tostring(io.read())\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s252610003", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read(\"*l\")\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550194004, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s252610003.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s252610003", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read(\"*l\")\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s211375001", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550193914, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s211375001.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s211375001", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s[i],#s[i])~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s320133356", "group_id": "codeNet:p03261", "input_text": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s,#s)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "language": "Lua", "metadata": {"date": 1550193119, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s320133356.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s320133356", "user_id": "u015229643"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N=io.read(\"n\")\ns={}\nfor i=1,N do \n  s[i]=io.read()\nend\nres=\"Yes\"\nfor i=1,N-1 do\n  if string.sub(s[i],#s,#s)~=string.sub(s[i+1],1,1) then\n    res=\"No\"\n  end\nend\ntable.sort(s)\nfor i=1,N-1 do\n  if s[i]==s[i+1] then\n    res=\"No\"\n  end\nend\nprint(res)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s896145989", "group_id": "codeNet:p03261", "input_text": "local n = io.read()\nlocal w = {}\nlocal flag = true\nfor i=1,n do\n\tw[i] = io.read()\nend\n\nfor i = 1, n-1 do\n\tif string.sub(w[i],-1,-1) ~= string.sub(w[i+1],1,1) then\n\tflag = false\n\tend\nend\n\nfor i = 1,n-1 do\n\tfor j=i+1,n do\n\t\tif w[i] == w[j] then\n\t\t    flag = false\n\t\tend\n\tend\nend\n\nif flag then\n\tprint(\"Yes\")\nelse\n\tprint(\"No\")\nend", "language": "Lua", "metadata": {"date": 1542341975, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s896145989.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896145989", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read()\nlocal w = {}\nlocal flag = true\nfor i=1,n do\n\tw[i] = io.read()\nend\n\nfor i = 1, n-1 do\n\tif string.sub(w[i],-1,-1) ~= string.sub(w[i+1],1,1) then\n\tflag = false\n\tend\nend\n\nfor i = 1,n-1 do\n\tfor j=i+1,n do\n\t\tif w[i] == w[j] then\n\t\t    flag = false\n\t\tend\n\tend\nend\n\nif flag then\n\tprint(\"Yes\")\nelse\n\tprint(\"No\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s693838334", "group_id": "codeNet:p03261", "input_text": "local n = io.read(\"*n\")\nio.read()\n\nlocal function test(n)\n    local test1 = {}\n    local useOK = \"YES\"\n    local protect = true\n    for i=1,n do\n        local s = io.read(\"*l\")\n        table.insert(test1,s)\n        if i > 1 then\n            local before = test1[i-1]\n            if string.sub(before,-1,-1) ~= string.sub(s,1,1) then\n                if protect then\n                    useOK =  \"NO\"\n                    protect = false\n                end\n\n            end\n        end\n    end\n    return useOK\nend\nprint(test(n))", "language": "Lua", "metadata": {"date": 1542341967, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s693838334.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s693838334", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read(\"*n\")\nio.read()\n\nlocal function test(n)\n    local test1 = {}\n    local useOK = \"YES\"\n    local protect = true\n    for i=1,n do\n        local s = io.read(\"*l\")\n        table.insert(test1,s)\n        if i > 1 then\n            local before = test1[i-1]\n            if string.sub(before,-1,-1) ~= string.sub(s,1,1) then\n                if protect then\n                    useOK =  \"NO\"\n                    protect = false\n                end\n\n            end\n        end\n    end\n    return useOK\nend\nprint(test(n))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s106306079", "group_id": "codeNet:p03261", "input_text": "a = io.read()\ns = {}\nflag = \"Yes\"\nlast = nil\nfor i = 1, a do\n\tb = io.read()\n\tif s[b] or (last and string.sub(b, 1, 1) ~= last) then\n\t\tflag = \"No\"\n\tend\n\ts[b] = true\n\tlast = string.sub(b, #b, #b)\nend\nprint(flag)", "language": "Lua", "metadata": {"date": 1542341435, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s106306079.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106306079", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "a = io.read()\ns = {}\nflag = \"Yes\"\nlast = nil\nfor i = 1, a do\n\tb = io.read()\n\tif s[b] or (last and string.sub(b, 1, 1) ~= last) then\n\t\tflag = \"No\"\n\tend\n\ts[b] = true\n\tlast = string.sub(b, #b, #b)\nend\nprint(flag)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s529881168", "group_id": "codeNet:p03261", "input_text": "local n = io.read(\"*n\")\nlocal tag = true\nlocal lastC = nil\nio.read()\nfor i = 1, n do\n\tlocal new = io.read(\"*line\")\n\tif i ~= 1 then\n\t\tlocal newC = string.sub(new,1,1)\n\t\tif string.find(newC, lastC) ~= 1 then\n\t\t\ttag = false\n\t\tend\n\tend\n\tlastC = string.sub(new, -1, -1)\nend\n\nif tag then \n\tprint(\"YES\")\nelse\n\tprint(\"NO\")\nend", "language": "Lua", "metadata": {"date": 1542341417, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s529881168.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s529881168", "user_id": "u353919145"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal tag = true\nlocal lastC = nil\nio.read()\nfor i = 1, n do\n\tlocal new = io.read(\"*line\")\n\tif i ~= 1 then\n\t\tlocal newC = string.sub(new,1,1)\n\t\tif string.find(newC, lastC) ~= 1 then\n\t\t\ttag = false\n\t\tend\n\tend\n\tlastC = string.sub(new, -1, -1)\nend\n\nif tag then \n\tprint(\"YES\")\nelse\n\tprint(\"NO\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s312805569", "group_id": "codeNet:p03261", "input_text": "local n = io.read(\"*n\")\nlocal tab = {}\nfor i = 1,n do\n    table.insert(tab, io.read(\"*l\"))\nend\n\nlocal firStr = tab[1]\nlocal myMap = {[firStr] = 1}\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal strStr = \"\"\nlocal result = true\nfor i = 2, n do\n    strStr = string.sub(tab[i], 1, 1)\n    if strStr == endStr then\n        result = false\n        print(\"NO\")\n        break\n    end\n    if myMap[tab[i]] then\n        result = false\n        print(\"NO\")\n        break\n    end\n    myMap[tab[i]] = 1\nend\n\nif result then\n    print(\"YES\")\nend", "language": "Lua", "metadata": {"date": 1542341416, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s312805569.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s312805569", "user_id": "u816631826"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal tab = {}\nfor i = 1,n do\n    table.insert(tab, io.read(\"*l\"))\nend\n\nlocal firStr = tab[1]\nlocal myMap = {[firStr] = 1}\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal strStr = \"\"\nlocal result = true\nfor i = 2, n do\n    strStr = string.sub(tab[i], 1, 1)\n    if strStr == endStr then\n        result = false\n        print(\"NO\")\n        break\n    end\n    if myMap[tab[i]] then\n        result = false\n        print(\"NO\")\n        break\n    end\n    myMap[tab[i]] = 1\nend\n\nif result then\n    print(\"YES\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s945674943", "group_id": "codeNet:p03261", "input_text": "local n = io.read(\"*n\")\nlocal tab = {}\nfor i = 1,n do\n    table.insert(tab, io.read(\"*l\"))\nend\n\nlocal firStr = tab[1]\nlocal myMap = {[firStr] = 1}\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal strStr = \"\"\nlocal result = true\nfor i = 2, n do\n    strStr = string.sub(tab[i], 1, 1)\n    if strStr == endStr then\n        result = false\n        print(\"No\")\n        break\n    end\n    if myMap[tab[i]] then\n        result = false\n        print(\"No\")\n        break\n    end\n    myMap[tab[i]] = 1\nend\n\nif result then\n    print(\"Yes\")\nend", "language": "Lua", "metadata": {"date": 1542341411, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s945674943.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945674943", "user_id": "u018679195"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal tab = {}\nfor i = 1,n do\n    table.insert(tab, io.read(\"*l\"))\nend\n\nlocal firStr = tab[1]\nlocal myMap = {[firStr] = 1}\nlocal len = string.len(firStr)\nlocal endStr = string.sub(firStr, len, len)\nlocal strStr = \"\"\nlocal result = true\nfor i = 2, n do\n    strStr = string.sub(tab[i], 1, 1)\n    if strStr == endStr then\n        result = false\n        print(\"No\")\n        break\n    end\n    if myMap[tab[i]] then\n        result = false\n        print(\"No\")\n        break\n    end\n    myMap[tab[i]] = 1\nend\n\nif result then\n    print(\"Yes\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s957039820", "group_id": "codeNet:p03261", "input_text": "a = io.read()\na = tonumber(a)\ns = {}\nflag = \"Yes\"\nlast = nil\nfor i = 1, a do\n\tb = io.read()\n\tif s[b] or (last and string.sub(b, 1, 1) ~= last) then\n\t\tflag = \"No\"\n\tend\n\ts[b] = true\n\tlast = string.sub(b, #b, #b)\nend\nprint(flag)", "language": "Lua", "metadata": {"date": 1542341410, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s957039820.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s957039820", "user_id": "u863370423"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "a = io.read()\na = tonumber(a)\ns = {}\nflag = \"Yes\"\nlast = nil\nfor i = 1, a do\n\tb = io.read()\n\tif s[b] or (last and string.sub(b, 1, 1) ~= last) then\n\t\tflag = \"No\"\n\tend\n\ts[b] = true\n\tlast = string.sub(b, #b, #b)\nend\nprint(flag)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s564219720", "group_id": "codeNet:p03261", "input_text": "local n = io.read()\nlocal wordTb = {}\nlocal hashValTb = {}\nlocal maxSize = n\n\nlocal function getHashVal(str)\n\tlocal hash = 0\n\tfor i=1, string.len(str) do\n\t\tlocal charN = string.byte(str,i)\n\t\thash = 33*hash + charN\n\tend\n\treturn hash % (maxSize+2)\nend\n\nlocal function checkWord(recordTb, word)\n\tlocal val = getHashVal(word)\n\tif hashValTb[val] then return false end\n\thashValTb[val] = true\n\tlocal lastWord = recordTb[#recordTb]\n\treturn string.byte(lastWord,#lastWord) == string.byte(word,1)\nend\n\nfor i=1, n do\n\tlocal input = io.read(\"*n\")\n\tlocal p = string.find(input, \"/n\")\n\tlocal word = string.sub(input, p)\n\twordTb[i] = word\n\tlocal ret = checkWord(wordTb, word)\n\tif not ret then\n\t\treturn \"NO\"\n\tend\nend\nreturn \"YES\"\n--#17025101 | rumexx's solution for [AtCoder-4252] [Problem B]", "language": "Lua", "metadata": {"date": 1542333776, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s564219720.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s564219720", "user_id": "u926674523"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read()\nlocal wordTb = {}\nlocal hashValTb = {}\nlocal maxSize = n\n\nlocal function getHashVal(str)\n\tlocal hash = 0\n\tfor i=1, string.len(str) do\n\t\tlocal charN = string.byte(str,i)\n\t\thash = 33*hash + charN\n\tend\n\treturn hash % (maxSize+2)\nend\n\nlocal function checkWord(recordTb, word)\n\tlocal val = getHashVal(word)\n\tif hashValTb[val] then return false end\n\thashValTb[val] = true\n\tlocal lastWord = recordTb[#recordTb]\n\treturn string.byte(lastWord,#lastWord) == string.byte(word,1)\nend\n\nfor i=1, n do\n\tlocal input = io.read(\"*n\")\n\tlocal p = string.find(input, \"/n\")\n\tlocal word = string.sub(input, p)\n\twordTb[i] = word\n\tlocal ret = checkWord(wordTb, word)\n\tif not ret then\n\t\treturn \"NO\"\n\tend\nend\nreturn \"YES\"\n--#17025101 | rumexx's solution for [AtCoder-4252] [Problem B]", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 776, "cpu_time_ms": 6, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s975382307", "group_id": "codeNet:p03261", "input_text": "local n = io.read()\nlocal w = {}\nlocal flag = true\nfor i=1,n do\n\tw[i] = io.read()\nend\n\nfor i = 1, n-1 do\n\tif string.sub(w[i],-1,-1) ~= string.sub(w[i+1],1,1) then\n\tflag = false\n\tend\nend\n\nfor i = 1,n-1 do\n\tfor j=i+1,n do\n\t\tif w[i] == w[j] then\n\t\t    flag = false\n\t\tend\n\tend\nend\n\nif flag then\n\tprint(\"Yes\")\nelse\n\tprint(\"No\")\nend\n--#17024844 | kachidoki's solution for [AtCoder-4252] [Problem B]", "language": "Lua", "metadata": {"date": 1542333488, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s975382307.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975382307", "user_id": "u926674523"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local n = io.read()\nlocal w = {}\nlocal flag = true\nfor i=1,n do\n\tw[i] = io.read()\nend\n\nfor i = 1, n-1 do\n\tif string.sub(w[i],-1,-1) ~= string.sub(w[i+1],1,1) then\n\tflag = false\n\tend\nend\n\nfor i = 1,n-1 do\n\tfor j=i+1,n do\n\t\tif w[i] == w[j] then\n\t\t    flag = false\n\t\tend\n\tend\nend\n\nif flag then\n\tprint(\"Yes\")\nelse\n\tprint(\"No\")\nend\n--#17024844 | kachidoki's solution for [AtCoder-4252] [Problem B]", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 392, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s773480431", "group_id": "codeNet:p03261", "input_text": "local double_check = function(t1)\n  if not t1 then\n    return false\n  end\n  local len = #t1\n  for i=1, len do\n    for j=i+1, len do\n      -- print('checking: ' .. i .. \", \" .. j)\n      if t1[i] == t1[j] then\n        return true\n      end\n    end\n  end\n  return false\nend\n\nlocal shiritori = function(s1, s2)\n  local first = string.sub(s2, 1, 1)\n  local last = string.sub(s1, -1)\n  --print(first)\n  --print(last)\n  if first == last then\n    return true\n  else\n    return false\n  end\nend\n\nlocal num = io.read(\"*n\")\nlocal data = {}\nfor i=1, num+1 do\n  local str = io.read(\"*l\")\n  data[i] = str\nend\nif double_check(data) then\n  print('No')\n  os.exit(0)\nend\n\nfor i=2, #data-1 do\n  if not shiritori(data[i], data[i+1]) then\n    -- print('checking: ' .. i .. \", \" .. i+1)\n    print('No')\n    os.exit(0)\n  end\nend\nprint('Yes')\nos.exit(0)", "language": "Lua", "metadata": {"date": 1537584686, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s773480431.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773480431", "user_id": "u824327681"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "local double_check = function(t1)\n  if not t1 then\n    return false\n  end\n  local len = #t1\n  for i=1, len do\n    for j=i+1, len do\n      -- print('checking: ' .. i .. \", \" .. j)\n      if t1[i] == t1[j] then\n        return true\n      end\n    end\n  end\n  return false\nend\n\nlocal shiritori = function(s1, s2)\n  local first = string.sub(s2, 1, 1)\n  local last = string.sub(s1, -1)\n  --print(first)\n  --print(last)\n  if first == last then\n    return true\n  else\n    return false\n  end\nend\n\nlocal num = io.read(\"*n\")\nlocal data = {}\nfor i=1, num+1 do\n  local str = io.read(\"*l\")\n  data[i] = str\nend\nif double_check(data) then\n  print('No')\n  os.exit(0)\nend\n\nfor i=2, #data-1 do\n  if not shiritori(data[i], data[i+1]) then\n    -- print('checking: ' .. i .. \", \" .. i+1)\n    print('No')\n    os.exit(0)\n  end\nend\nprint('Yes')\nos.exit(0)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 828, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s417271874", "group_id": "codeNet:p03261", "input_text": "N = tonumber(io.read())\n\nWU = {}\n\npW = io.read()\nWU[pW] = true\n\nans = \"Yes\"\n\nfor v = 2, N do\n  Wx = io.read()\n\n  if WU[Wx] or string.match(string.reverse(pW), \"%a\") ~= string.match(Wx, \"%a\") then\n    ans = \"No\"\n    break\n  end\n  \n  WU[Wx] = true\n\n  pW = Wx\n\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1536456956, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lua/s417271874.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417271874", "user_id": "u374892957"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "N = tonumber(io.read())\n\nWU = {}\n\npW = io.read()\nWU[pW] = true\n\nans = \"Yes\"\n\nfor v = 2, N do\n  Wx = io.read()\n\n  if WU[Wx] or string.match(string.reverse(pW), \"%a\") ~= string.match(Wx, \"%a\") then\n    ans = \"No\"\n    break\n  end\n  \n  WU[Wx] = true\n\n  pW = Wx\n\nend\n\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 113, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s072756477", "group_id": "codeNet:p03262", "input_text": "function gcd(a,b)\n    if b~=0 then\n        return gcd(b,a%b)\n    else\n        return a\n    end\nend\n\nn,x=io.read(\"*n\",\"*n\")\nd=0\nfor i=1,n do\n    y=math.abs(x-io.read(\"*n\"))\n    if y>0 then\n        if d==0 then\n            d=y\n        else\n            d=gcd(y,d)\n        end\n    end\nend\nprint(d)", "language": "Lua", "metadata": {"date": 1589329696, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s072756477.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s072756477", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function gcd(a,b)\n    if b~=0 then\n        return gcd(b,a%b)\n    else\n        return a\n    end\nend\n\nn,x=io.read(\"*n\",\"*n\")\nd=0\nfor i=1,n do\n    y=math.abs(x-io.read(\"*n\"))\n    if y>0 then\n        if d==0 then\n            d=y\n        else\n            d=gcd(y,d)\n        end\n    end\nend\nprint(d)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 69, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s285893011", "group_id": "codeNet:p03262", "input_text": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nfor i=2,n+1 do\n    d=math.min(d,city[i]-city[i-1])\nend\nprint(d)", "language": "Lua", "metadata": {"date": 1589327807, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s285893011.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s285893011", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nfor i=2,n+1 do\n    d=math.min(d,city[i]-city[i-1])\nend\nprint(d)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 128, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s361181374", "group_id": "codeNet:p03262", "input_text": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n+1 do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "language": "Lua", "metadata": {"date": 1589327503, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s361181374.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361181374", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n+1 do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 127, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s103812993", "group_id": "codeNet:p03262", "input_text": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "language": "Lua", "metadata": {"date": 1589327398, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s103812993.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s103812993", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n,x=io.read(\"*n\",\"*n\")\ncity={x}\nfor i=1,n do\n    table.insert(city,io.read(\"*n\"))\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 127, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s480658682", "group_id": "codeNet:p03262", "input_text": "n,x=io.read(\"*n\",\"*n\")\ncity={}\nfor i=1,n do\n    city[i]=io.read(\"*n\")\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "language": "Lua", "metadata": {"date": 1589327287, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s480658682.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s480658682", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n,x=io.read(\"*n\",\"*n\")\ncity={}\nfor i=1,n do\n    city[i]=io.read(\"*n\")\nend\ntable.sort(city)\n\nd=10^9+1\nif #city>1 then\n    for i=2,n do\n        d=math.min(d,city[i]-city[i-1])\n    end\nelse\n    d=city[1]-x\nend\nprint(d)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 111, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s756543731", "group_id": "codeNet:p03262", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal function getgcd(x, y)\n  while(0 < y) do\n    x, y = y, x % y\n  end\n  return x\nend\nlocal gcd = 0\nfor i = 1, n do\n  local t = math.abs(k - io.read(\"*n\"))\n  if(t ~= 0) then\n    if(gcd == 0) then gcd = t else gcd = getgcd(gcd, t) end\n  end\nend\nprint(gcd)\n", "language": "Lua", "metadata": {"date": 1556145397, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s756543731.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s756543731", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal function getgcd(x, y)\n  while(0 < y) do\n    x, y = y, x % y\n  end\n  return x\nend\nlocal gcd = 0\nfor i = 1, n do\n  local t = math.abs(k - io.read(\"*n\"))\n  if(t ~= 0) then\n    if(gcd == 0) then gcd = t else gcd = getgcd(gcd, t) end\n  end\nend\nprint(gcd)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 50, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s754470147", "group_id": "codeNet:p03262", "input_text": "local n, k = io.read(\"*n\", \"*n\")\nlocal function getgcd(x, y)\n  while(0 < y) do\n    x, y = y, x % y\n  end\n  return x\nend\nlocal gcd = math.abs(k - io.read(\"*n\"))\nfor i = 2, n do\n  gcd = getgcd(gcd, k - io.read(\"*n\"))\nend\nprint(gcd)\n", "language": "Lua", "metadata": {"date": 1556145232, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s754470147.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s754470147", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local n, k = io.read(\"*n\", \"*n\")\nlocal function getgcd(x, y)\n  while(0 < y) do\n    x, y = y, x % y\n  end\n  return x\nend\nlocal gcd = math.abs(k - io.read(\"*n\"))\nfor i = 2, n do\n  gcd = getgcd(gcd, k - io.read(\"*n\"))\nend\nprint(gcd)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s202512226", "group_id": "codeNet:p03262", "input_text": "function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n\nfunction 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 N, X = io.read(\"n\", \"n\")\nlocal x = {}\nfor i=1,N do\n    x[i] = io.read(\"n\")\nend\ntable.insert(x, X)\ntable.sort(x)\nlocal diffs = {}\nfor i=2,#x do\n    table.insert(diffs, x[i] - x[i - 1])\nend\nlocal ans = gcdmany(diffs)\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1553928236, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s202512226.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202512226", "user_id": "u162773977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function gcd(a,b)\n    if b == 0 then\n        return a\n    else\n        return gcd(b, a % b)\n    end\nend\n\nfunction 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 N, X = io.read(\"n\", \"n\")\nlocal x = {}\nfor i=1,N do\n    x[i] = io.read(\"n\")\nend\ntable.insert(x, X)\ntable.sort(x)\nlocal diffs = {}\nfor i=2,#x do\n    table.insert(diffs, x[i] - x[i - 1])\nend\nlocal ans = gcdmany(diffs)\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 461, "cpu_time_ms": 132, "memory_kb": 4472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s372356683", "group_id": "codeNet:p03262", "input_text": "N=io.read(\"n\")\nX=io.read(\"n\")\nx={}\nfor i=1,N do\n  x[i]=io.read(\"n\")\nend\nfunction d(a,b)\n  while(true) do\n  \tlocal r=a%b\n  \ta=b\n  \tb=r\n \tif r==0 then\n    break\n    end\n  end\nreturn a\nend\n    \t\nres=math.abs(X-x[1])\nfor i=2,N do\n  res=d(res,math.abs(X-x[i]))\nend\nprint(res)", "language": "Lua", "metadata": {"date": 1550198792, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s372356683.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s372356683", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read(\"n\")\nX=io.read(\"n\")\nx={}\nfor i=1,N do\n  x[i]=io.read(\"n\")\nend\nfunction d(a,b)\n  while(true) do\n  \tlocal r=a%b\n  \ta=b\n  \tb=r\n \tif r==0 then\n    break\n    end\n  end\nreturn a\nend\n    \t\nres=math.abs(X-x[1])\nfor i=2,N do\n  res=d(res,math.abs(X-x[i]))\nend\nprint(res)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 58, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s586631605", "group_id": "codeNet:p03262", "input_text": "N=io.read(\"n\")\nX=io.read(\"n\")\nx={}\nfor i=1,N do\n  x[i]=io.read(\"n\")\nend\nh={}\nfor i=1,N do\n  h[i]=X-x[i] \n  if h[i]<0 then\n    h[i]=-h[i]\n  end\nend\ntable.sort(h)\nres=1\nfor i=h[1],1,-1 do\n  for j=1,N do\n    if h[j]%i~=0 then \n      res=0\n      break\n    end\n  end\n  if res==1 then\n    print(i)\n    break\n  end\nend", "language": "Lua", "metadata": {"date": 1550197295, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s586631605.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s586631605", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read(\"n\")\nX=io.read(\"n\")\nx={}\nfor i=1,N do\n  x[i]=io.read(\"n\")\nend\nh={}\nfor i=1,N do\n  h[i]=X-x[i] \n  if h[i]<0 then\n    h[i]=-h[i]\n  end\nend\ntable.sort(h)\nres=1\nfor i=h[1],1,-1 do\n  for j=1,N do\n    if h[j]%i~=0 then \n      res=0\n      break\n    end\n  end\n  if res==1 then\n    print(i)\n    break\n  end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 4472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s431660353", "group_id": "codeNet:p03262", "input_text": "N=io.read()\nX=io.read()\nx={}\nfor i=1,N do\n  x[i]=io.read()\nend\nh={}\nfor i=1,N do\n  h[i]=X-x[i] \n  if h[i]<0 then\n    h[i]=-h[i]\n  end\nend\ntable.sort(h)\nres=true\nfor i=h[1],1,-1 do\n  for j=1,N do\n    if h[j]%i~=0 then \n      res=false\n      break\n    end\n  end\n  if res==true then\n    print(i)\n    break\n  end\nend", "language": "Lua", "metadata": {"date": 1550196781, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s431660353.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s431660353", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read()\nX=io.read()\nx={}\nfor i=1,N do\n  x[i]=io.read()\nend\nh={}\nfor i=1,N do\n  h[i]=X-x[i] \n  if h[i]<0 then\n    h[i]=-h[i]\n  end\nend\ntable.sort(h)\nres=true\nfor i=h[1],1,-1 do\n  for j=1,N do\n    if h[j]%i~=0 then \n      res=false\n      break\n    end\n  end\n  if res==true then\n    print(i)\n    break\n  end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 4, "memory_kb": 2296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s793673643", "group_id": "codeNet:p03262", "input_text": "function Getnum(number1,number2)\n\tlocal intTemp=1;\n\tif number2 < number1 then\n\t\tintTemp=number2;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\twhile(number1~=0) do\n\t\tintTemp =number2 % number1;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\treturn number2;\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)", "language": "Lua", "metadata": {"date": 1542341433, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s793673643.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s793673643", "user_id": "u863370423"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function Getnum(number1,number2)\n\tlocal intTemp=1;\n\tif number2 < number1 then\n\t\tintTemp=number2;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\twhile(number1~=0) do\n\t\tintTemp =number2 % number1;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\treturn number2;\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 443, "cpu_time_ms": 4, "memory_kb": 2296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s033334275", "group_id": "codeNet:p03262", "input_text": "local function qiuyu(x, y)\n\tif x > y then\n\t\tlocal t = x\n\t\tx = y\n\t\tt = t\n\tend\n\tlocal a = x % y\n\tif a == 0 then\n\t\treturn y\n\telse\n\t\treturn qiuyu(y, a)\n\tend\nend\n\nlocal n = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal last = nil\nfor i = 1, n do\n\tlocal tmp = io.read(\"*n\")\n\tlocal tmp2 = math.abs(tmp - x)\n\tif last then\n\t\tlast = qiuyu(last, tmp2)\n\telse\n\t\tlast = tmp2\n\tend\nend\nprint(last)", "language": "Lua", "metadata": {"date": 1542341416, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s033334275.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s033334275", "user_id": "u018679195"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local function qiuyu(x, y)\n\tif x > y then\n\t\tlocal t = x\n\t\tx = y\n\t\tt = t\n\tend\n\tlocal a = x % y\n\tif a == 0 then\n\t\treturn y\n\telse\n\t\treturn qiuyu(y, a)\n\tend\nend\n\nlocal n = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal last = nil\nfor i = 1, n do\n\tlocal tmp = io.read(\"*n\")\n\tlocal tmp2 = math.abs(tmp - x)\n\tif last then\n\t\tlast = qiuyu(last, tmp2)\n\telse\n\t\tlast = tmp2\n\tend\nend\nprint(last)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 56, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s199558509", "group_id": "codeNet:p03262", "input_text": "function Getnum(number1,number2)\n\tlocal intTemp=1\n\tif number2 < number1 then\n\t\tintTemp=number2\n\t\tnumber2=number1\n\t\tnumber1=intTemp\n\tend\n\twhile number1~=0 do\n\t\tintTemp =number2 % number1\n\t\tnumber2=number1\n\t\tnumber1=intTemp\n\tend\n\treturn number2\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1542341410, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s199558509.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s199558509", "user_id": "u816631826"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function Getnum(number1,number2)\n\tlocal intTemp=1\n\tif number2 < number1 then\n\t\tintTemp=number2\n\t\tnumber2=number1\n\t\tnumber1=intTemp\n\tend\n\twhile number1~=0 do\n\t\tintTemp =number2 % number1\n\t\tnumber2=number1\n\t\tnumber1=intTemp\n\tend\n\treturn number2\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 2296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s084796732", "group_id": "codeNet:p03262", "input_text": "n = io.read(\"*n\")\nx = io.read(\"*n\")\ns = {}\nfor i = 1, n do\n\ts[i] = io.read(\"*n\")\nend\n\nfunction d(m, n)\n\twhile true do\n\t\tr = m%n\n\t\tm = n\n\t\tn = r\n\t\tif r == 0 then\n\t\t\tbreak\n\t\tend\n\tend\n\treturn m\nend\n\nret = nil\nfor i = 1, n do\n\tif s[i] ~= x then\n\t\tif ret == nil then\n\t\t\tret = math.abs(s[i] - x)\n\t\telse\n\t\t\tret = d(ret, math.abs(s[i]-x))\n\t\tend\n\tend\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1542341409, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s084796732.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s084796732", "user_id": "u863370423"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "n = io.read(\"*n\")\nx = io.read(\"*n\")\ns = {}\nfor i = 1, n do\n\ts[i] = io.read(\"*n\")\nend\n\nfunction d(m, n)\n\twhile true do\n\t\tr = m%n\n\t\tm = n\n\t\tn = r\n\t\tif r == 0 then\n\t\t\tbreak\n\t\tend\n\tend\n\treturn m\nend\n\nret = nil\nfor i = 1, n do\n\tif s[i] ~= x then\n\t\tif ret == nil then\n\t\t\tret = math.abs(s[i] - x)\n\t\telse\n\t\t\tret = d(ret, math.abs(s[i]-x))\n\t\tend\n\tend\nend\nprint(ret)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 356, "cpu_time_ms": 78, "memory_kb": 2424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s209276806", "group_id": "codeNet:p03262", "input_text": "function Getnum(number1,number2)\n\tlocal intTemp=1;\n\tif number2 < number1 then\n\t\tintTemp=number2;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\twhile(number1~=0) do\n\t\tintTemp =number2 % number1;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\treturn number2;\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)\n--#17025109 | kachidoki's solution for [AtCoder-4255] [Problem C]", "language": "Lua", "metadata": {"date": 1542333818, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s209276806.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s209276806", "user_id": "u926674523"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "function Getnum(number1,number2)\n\tlocal intTemp=1;\n\tif number2 < number1 then\n\t\tintTemp=number2;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\twhile(number1~=0) do\n\t\tintTemp =number2 % number1;\n\t\tnumber2=number1;\n\t\tnumber1=intTemp;\n\tend\n\treturn number2;\nend\n\nlocal n = io.read()\nlocal x = io.read()\nlocal s = {}\nlocal sum = s[1]\nfor i=1,n do\n\ta = io.read()\n\ts[i] = a>x and a-x or x-a\nend\n\nfor i=1,n-1 do\n\tsum = Getnum(sum,s[i+1])\nend\n\nprint(sum)\n--#17025109 | kachidoki's solution for [AtCoder-4255] [Problem C]", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 509, "cpu_time_ms": 8, "memory_kb": 2296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s212261290", "group_id": "codeNet:p03262", "input_text": "local split_space = function(str)\n  words = {}\n  for word in str:gmatch(\"%w+\") do\n    table.insert(words, tonumber(word))\n  end\n  return words\nend\n\ngcd = function(a, b)\n  if b ~= 0 then\n    return gcd(b, a % b)\n  else\n    return math.abs(a)\n  end\nend\n\nlocal nx = split_space(io.read(\"*l\"))\nlocal data = split_space(io.read(\"*l\"))\nif #data == 1 then\n  print(data[1] - 1)\n  os.exit(0)\nend\ntable.insert(data, nx[2])\ntable.sort(data)\nlocal ans = 0\nlocal diff = {}\nfor i=1, #data-1 do\n  local d1 = data[i+1] - data[i]\n  table.insert(diff, d1)\nend\nans = gcd(diff[1], diff[2])\nfor i=3, #diff do\n  local tmp = gcd(ans, diff[i])\n  if tmp > ans then\n    ans = tmp\n  end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1537628532, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s212261290.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s212261290", "user_id": "u824327681"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local split_space = function(str)\n  words = {}\n  for word in str:gmatch(\"%w+\") do\n    table.insert(words, tonumber(word))\n  end\n  return words\nend\n\ngcd = function(a, b)\n  if b ~= 0 then\n    return gcd(b, a % b)\n  else\n    return math.abs(a)\n  end\nend\n\nlocal nx = split_space(io.read(\"*l\"))\nlocal data = split_space(io.read(\"*l\"))\nif #data == 1 then\n  print(data[1] - 1)\n  os.exit(0)\nend\ntable.insert(data, nx[2])\ntable.sort(data)\nlocal ans = 0\nlocal diff = {}\nfor i=1, #data-1 do\n  local d1 = data[i+1] - data[i]\n  table.insert(diff, d1)\nend\nans = gcd(diff[1], diff[2])\nfor i=3, #diff do\n  local tmp = gcd(ans, diff[i])\n  if tmp > ans then\n    ans = tmp\n  end\nend\nprint(ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 674, "cpu_time_ms": 192, "memory_kb": 10672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s988717874", "group_id": "codeNet:p03262", "input_text": "function gcd(u, v)\n  while v ~= 0 do\n    u, v = v, u%v\n  end\n  return u\nend\n\nN, X = io.read(\"*n\", \"*n\")\nio.read()\n\nx = {}\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\n\nd = math.abs(X - x[1])\n\nfor v = 2, N do\n  d = gcd(d, math.abs(X - x[v]))\nend\n\nprint(d)\n", "language": "Lua", "metadata": {"date": 1536460857, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lua/s988717874.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988717874", "user_id": "u374892957"}, "prompt_components": {"gold_output": "2\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\nN, X = io.read(\"*n\", \"*n\")\nio.read()\n\nx = {}\n\nfor v in string.gmatch(io.read(), \"(%d+)\") do\n  table.insert(x, tonumber(v))\nend\n\nd = math.abs(X - x[1])\n\nfor v = 2, N do\n  d = gcd(d, math.abs(X - x[v]))\nend\n\nprint(d)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 101, "memory_kb": 7600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s471784938", "group_id": "codeNet:p03324", "input_text": "d, n = io.read(\"*n\", \"*n\")\nif n == 100 then n = 101 end\nfor i = 1, d do n = n * 100 end\nprint(n)\n", "language": "Lua", "metadata": {"date": 1594179331, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s471784938.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471784938", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = io.read(\"*n\", \"*n\")\nif n == 100 then n = 101 end\nfor i = 1, d do n = n * 100 end\nprint(n)\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 8, "memory_kb": 2784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s240950005", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((100^d)*101))\nelse\n    print(math.floor((100^d)*n))\nend", "language": "Lua", "metadata": {"date": 1588199417, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s240950005.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240950005", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((100^d)*101))\nelse\n    print(math.floor((100^d)*n))\nend", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s241617264", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((100^d)*99))\nelse\n    print(math.floor((100^d)*n))\nend", "language": "Lua", "metadata": {"date": 1588199342, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s241617264.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s241617264", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((100^d)*99))\nelse\n    print(math.floor((100^d)*n))\nend", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s558687266", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((99^d)*n))\nelse\n    print(math.floor((100^d)*n))\nend", "language": "Lua", "metadata": {"date": 1588199303, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s558687266.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s558687266", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print(math.floor((99^d)*n))\nelse\n    print(math.floor((100^d)*n))\nend", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s996625549", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print((99^d)*n)\nelse\n    print((100^d)*n)\nend", "language": "Lua", "metadata": {"date": 1588199215, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s996625549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s996625549", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\nif n==100 then\n    print((99^d)*n)\nelse\n    print((100^d)*n)\nend", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s915345671", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\nif(n == 100) then n = n + 1 end\nfor i = 1, d do n = n * 100 end\nprint(n)", "language": "Lua", "metadata": {"date": 1555202504, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s915345671.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915345671", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\nif(n == 100) then n = n + 1 end\nfor i = 1, d do n = n * 100 end\nprint(n)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s172447773", "group_id": "codeNet:p03324", "input_text": "d,n=io.read(\"*n\",\"*n\")\na = math.floor(n / 99) * 100 + (n - 1) % 99 + 1\nfor i = 1, d do a = a * 100 end\nprint(a)", "language": "Lua", "metadata": {"date": 1555202393, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s172447773.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s172447773", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d,n=io.read(\"*n\",\"*n\")\na = math.floor(n / 99) * 100 + (n - 1) % 99 + 1\nfor i = 1, d do a = a * 100 end\nprint(a)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s024063350", "group_id": "codeNet:p03324", "input_text": "D=io.read(\"n\")\nN=io.read(\"n\")\nif N==100 then\n  N=N+1\nend\nt=math.modf(N*100^D)\nprint(t)", "language": "Lua", "metadata": {"date": 1550614486, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s024063350.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s024063350", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "D=io.read(\"n\")\nN=io.read(\"n\")\nif N==100 then\n  N=N+1\nend\nt=math.modf(N*100^D)\nprint(t)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 6, "memory_kb": 752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s598224032", "group_id": "codeNet:p03324", "input_text": "D=io.read(\"n\")\nN=io.read(\"n\")\nt=math.modf(N*100^D)\nprint(t)", "language": "Lua", "metadata": {"date": 1550613023, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s598224032.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s598224032", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "D=io.read(\"n\")\nN=io.read(\"n\")\nt=math.modf(N*100^D)\nprint(t)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 253, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s988269974", "group_id": "codeNet:p03324", "input_text": "D=io.read(\"n\")\nN=io.read(\"n\")\nprint(N*100^D)", "language": "Lua", "metadata": {"date": 1550612381, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s988269974.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s988269974", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "D=io.read(\"n\")\nN=io.read(\"n\")\nprint(N*100^D)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s746647541", "group_id": "codeNet:p03324", "input_text": "D=io.read()\nN=io.read()\nprint(N*100^D)", "language": "Lua", "metadata": {"date": 1550612206, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s746647541.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s746647541", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "D=io.read()\nN=io.read()\nprint(N*100^D)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s718158190", "group_id": "codeNet:p03324", "input_text": "D=io.read()\nN=io.raed()\nprint(N*100^D)", "language": "Lua", "metadata": {"date": 1550612124, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s718158190.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s718158190", "user_id": "u015229643"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "D=io.read()\nN=io.raed()\nprint(N*100^D)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s747439456", "group_id": "codeNet:p03324", "input_text": "d, n = io.read(\"*n\",\"*n\")\n\nif n == 100 then\n  n = n + 1\nend\n\nprint(string.format(\"%d\", 100^d * n))\n", "language": "Lua", "metadata": {"date": 1529203187, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s747439456.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747439456", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = io.read(\"*n\",\"*n\")\n\nif n == 100 then\n  n = n + 1\nend\n\nprint(string.format(\"%d\", 100^d * n))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 72, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s246000153", "group_id": "codeNet:p03324", "input_text": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nif n == 100 then\n  n = n + 1\nend\n\nprint(string.format(\"%d\", 100^d * n))\n", "language": "Lua", "metadata": {"date": 1529203072, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s246000153.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s246000153", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nif n == 100 then\n  n = n + 1\nend\n\nprint(string.format(\"%d\", 100^d * n))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s188835832", "group_id": "codeNet:p03324", "input_text": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nio.write(string.format(\"%d\", 100^d * n))\n", "language": "Lua", "metadata": {"date": 1529201952, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s188835832.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s188835832", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nio.write(string.format(\"%d\", 100^d * n))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 147, "memory_kb": 1132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s589244316", "group_id": "codeNet:p03324", "input_text": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\nd, n = tonumber(d), tonumber(n)\n\nprint(string.format(\"%d\", 100^d * n))\n", "language": "Lua", "metadata": {"date": 1529201897, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s589244316.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s589244316", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\nd, n = tonumber(d), tonumber(n)\n\nprint(string.format(\"%d\", 100^d * n))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 203, "memory_kb": 1132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s801918480", "group_id": "codeNet:p03324", "input_text": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nprint(string.format(\"%d\", 100^d * n))", "language": "Lua", "metadata": {"date": 1529201814, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s801918480.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s801918480", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = string.match(io.read(), \"(%d+) (%d+)\")\n\nprint(string.format(\"%d\", 100^d * n))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 48, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s747501667", "group_id": "codeNet:p03324", "input_text": "d, n = io.read(\"*n\",\"*n\")\n\nprint(string.format(\"%d\", 100^d * n))", "language": "Lua", "metadata": {"date": 1529201291, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s747501667.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s747501667", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = io.read(\"*n\",\"*n\")\n\nprint(string.format(\"%d\", 100^d * n))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 100, "memory_kb": 1132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s216890440", "group_id": "codeNet:p03324", "input_text": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.modf(math.pow(100, d), 1);\nlocal r = p * n;\nif n == 100 then\n  r = r + p;\nend\nprint(r);", "language": "Lua", "metadata": {"date": 1529199018, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s216890440.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s216890440", "user_id": "u061001716"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.modf(math.pow(100, d), 1);\nlocal r = p * n;\nif n == 100 then\n  r = r + p;\nend\nprint(r);", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 100, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s132713334", "group_id": "codeNet:p03324", "input_text": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.pow(100, d);\nlocal r = math.modf(p * n, 1);\nif n == 100 then\n  r = r + p;\nend\nprint(r);", "language": "Lua", "metadata": {"date": 1529198533, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s132713334.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s132713334", "user_id": "u061001716"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.pow(100, d);\nlocal r = math.modf(p * n, 1);\nif n == 100 then\n  r = r + p;\nend\nprint(r);", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 275, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s110325457", "group_id": "codeNet:p03324", "input_text": "d, n = io.read(\"*n\",\"*n\")\n\nprint(string.format(\"%d\", 100^d * n))", "language": "Lua", "metadata": {"date": 1529198053, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s110325457.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s110325457", "user_id": "u374892957"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "d, n = io.read(\"*n\",\"*n\")\n\nprint(string.format(\"%d\", 100^d * n))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s225033838", "group_id": "codeNet:p03324", "input_text": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.pow(100, d);\nlocal r = math.modf(p * n, 1);\nprint(r);", "language": "Lua", "metadata": {"date": 1529197798, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lua/s225033838.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s225033838", "user_id": "u061001716"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local d, n = string.match(io.read(), \"(%d+) (%d+)\");\nd, n = tonumber(d), tonumber(n);\n\nlocal p = math.pow(100, d);\nlocal r = math.modf(p * n, 1);\nprint(r);", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 95, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s529141778", "group_id": "codeNet:p03448", "input_text": "A, B, C, X = io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\")\ncounter = 0\nfor i = 0, A do\n    for j = 0, B do\n        for k = 0, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1587088243, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s529141778.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s529141778", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A, B, C, X = io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\")\ncounter = 0\nfor i = 0, A do\n    for j = 0, B do\n        for k = 0, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 1012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s814177611", "group_id": "codeNet:p03448", "input_text": "A, B, C, X = io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\")\ncounter = 0\nfor i = 1, A do\n    for j = 1, B do\n        for k = 1, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1587088136, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s814177611.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s814177611", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A, B, C, X = io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\"), io.read(\"*n\", \"*l\")\ncounter = 0\nfor i = 1, A do\n    for j = 1, B do\n        for k = 1, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s958362578", "group_id": "codeNet:p03448", "input_text": "A, B, C, X = io.read(\"*n\", \"*l\", \"*n\", \"*l\", \"*n\", \"*l\", \"*n\", \"*l\")\ncounter = 0\nfor i = 1, A do\n    for j = 1, B do\n        for k = 1, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1587088073, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s958362578.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s958362578", "user_id": "u045238009"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A, B, C, X = io.read(\"*n\", \"*l\", \"*n\", \"*l\", \"*n\", \"*l\", \"*n\", \"*l\")\ncounter = 0\nfor i = 1, A do\n    for j = 1, B do\n        for k = 1, C do\n            if 500*i+100*j+50*k == X then\n                counter = counter+1\n            end\n        end\n    end\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s111921132", "group_id": "codeNet:p03448", "input_text": "local A, B, C = io.read(\"*n\", \"*n\", \"*n\")\nlocal price = io.read(\"*n\")\nlocal count = 0\n\nfor a = 0, A do\n    for b = 0, B do\n        for c = 0, C do\n            if 500*a + 100*b + 50*c == price then\n                count = count + 1\n            end\n        end\n    end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1586463663, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s111921132.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111921132", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local A, B, C = io.read(\"*n\", \"*n\", \"*n\")\nlocal price = io.read(\"*n\")\nlocal count = 0\n\nfor a = 0, A do\n    for b = 0, B do\n        for c = 0, C do\n            if 500*a + 100*b + 50*c == price then\n                count = count + 1\n            end\n        end\n    end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s899327130", "group_id": "codeNet:p03448", "input_text": "local ior = io.read\nlocal am, bm, cm, x = ior(\"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal cnt = 0\nfor a = 0, am do for b = 0, bm do for c = 0, cm do\n  if(a * 500 + b * 100 + c * 50 == x) then cnt = cnt + 1 end\nend end end\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1556480634, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s899327130.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899327130", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.read\nlocal am, bm, cm, x = ior(\"*n\", \"*n\", \"*n\", \"*n\")\n\nlocal cnt = 0\nfor a = 0, am do for b = 0, bm do for c = 0, cm do\n  if(a * 500 + b * 100 + c * 50 == x) then cnt = cnt + 1 end\nend end end\nprint(cnt)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s740810638", "group_id": "codeNet:p03448", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nX=io.read(\"n\")\nlocal count=0\nfor i=0,A do\n  for j=0,B do\n    for k=0,C do\n      if i*500+j*100+k*50==X then\n        count=count+1\n      end\n    end\n  end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1551120369, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s740810638.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740810638", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nX=io.read(\"n\")\nlocal count=0\nfor i=0,A do\n  for j=0,B do\n    for k=0,C do\n      if i*500+j*100+k*50==X then\n        count=count+1\n      end\n    end\n  end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 13, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s781059388", "group_id": "codeNet:p03448", "input_text": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nX=io.read(\"n\")\nlocal count=0\nfor i=0,A do\n  for j=0,B do\n    for k=0,C do\n      if A*500+B*100+C*50==X then\n        count=count+1\n      end\n    end\n  end\nend\nprint(count)", "language": "Lua", "metadata": {"date": 1551120277, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s781059388.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s781059388", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "A=io.read(\"n\")\nB=io.read(\"n\")\nC=io.read(\"n\")\nX=io.read(\"n\")\nlocal count=0\nfor i=0,A do\n  for j=0,B do\n    for k=0,C do\n      if A*500+B*100+C*50==X then\n        count=count+1\n      end\n    end\n  end\nend\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 17, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s468868569", "group_id": "codeNet:p03448", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109428, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s468868569.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468868569", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s877904357", "group_id": "codeNet:p03448", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109362, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s877904357.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s877904357", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s139348887", "group_id": "codeNet:p03448", "input_text": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109355, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s139348887.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s139348887", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal c = io.read(\"*n\")\nlocal x = io.read(\"*n\")\nlocal r = 0\nfor i = 0, 500 do\n  for j = 0, (x - 500 * i) / 100 do\n    local k = x - 500 * i - 100 * j\n    if k % 50 == 0 and c >= k / 50 and a >= i and b >= j then\n      r = r + 1\n    end\n  end\nend\nreturn print(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s180843373", "group_id": "codeNet:p03448", "input_text": "a = io.read(\"*number\")\nb = io.read(\"*number\")\nc = io.read(\"*number\")\nx = io.read(\"*number\")\nans = 0\n\nfor i = 0, a do\n  for j = 0, b do\n    for k = 0, c do\n      if i*500+j*100+k*50 == x then\n        ans = ans + 1\n      end\n    end\n  end\nend\nprint(ans)", "language": "Lua", "metadata": {"date": 1517985278, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lua/s180843373.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180843373", "user_id": "u079330987"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a = io.read(\"*number\")\nb = io.read(\"*number\")\nc = io.read(\"*number\")\nx = io.read(\"*number\")\nans = 0\n\nfor i = 0, a do\n  for j = 0, b do\n    for k = 0, c do\n      if i*500+j*100+k*50 == x then\n        ans = ans + 1\n      end\n    end\n  end\nend\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s491795651", "group_id": "codeNet:p03455", "input_text": "a, b = io.read(\"*n\", \"*n\")\nif (a * b) % 2 == 0 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1594094201, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s491795651.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491795651", "user_id": "u120582723"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a, b = io.read(\"*n\", \"*n\")\nif (a * b) % 2 == 0 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s735500138", "group_id": "codeNet:p03455", "input_text": "local ffi=require\"ffi\"\nffi.cdef[[\nint open(const char*,int,...);\nint close(int);\nvoid* mmap(void*,size_t,int,int,int,int);\nint munmap(void*,size_t);\n]]\nlocal C=ffi.C\nlocal program=\"\\x48\\x89\\xf8\\x48\\x21\\xf0\\x48\\x83\\xe0\\x01\\xc3\"\nlocal fd=C.open(\"/dev/zero\",0)\nlocal mem=C.mmap(nil,#program,6,2,fd,0)\nffi.copy(mem,program,#program)\nlocal fn=ffi.cast(\"int(*)(int,int)\",mem)\nprint(fn(io.read\"*n\",io.read\"*n\")~=0 and\"Odd\"or\"Even\")\nC.munmap(mem,#program)\nC.close(fd)", "language": "Lua", "metadata": {"date": 1589085411, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s735500138.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735500138", "user_id": "u726173718"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local ffi=require\"ffi\"\nffi.cdef[[\nint open(const char*,int,...);\nint close(int);\nvoid* mmap(void*,size_t,int,int,int,int);\nint munmap(void*,size_t);\n]]\nlocal C=ffi.C\nlocal program=\"\\x48\\x89\\xf8\\x48\\x21\\xf0\\x48\\x83\\xe0\\x01\\xc3\"\nlocal fd=C.open(\"/dev/zero\",0)\nlocal mem=C.mmap(nil,#program,6,2,fd,0)\nffi.copy(mem,program,#program)\nlocal fn=ffi.cast(\"int(*)(int,int)\",mem)\nprint(fn(io.read\"*n\",io.read\"*n\")~=0 and\"Odd\"or\"Even\")\nC.munmap(mem,#program)\nC.close(fd)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 459, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s623668374", "group_id": "codeNet:p03455", "input_text": "a , b = io.read(\"*n\" , \"*n\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1586406850, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s623668374.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623668374", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a , b = io.read(\"*n\" , \"*n\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s492485636", "group_id": "codeNet:p03455", "input_text": "a , b = io.read(\"*a\" , \"*b\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1586406834, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s492485636.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s492485636", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a , b = io.read(\"*a\" , \"*b\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s183736738", "group_id": "codeNet:p03455", "input_text": "local a , b = io.read(\"*a\" , \"*b\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1586406407, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s183736738.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s183736738", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a , b = io.read(\"*a\" , \"*b\")\nif a*b % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s545202823", "group_id": "codeNet:p03455", "input_text": "local a , b = io.read(\"*a\" , \"*b\")\nc = a * b\nif c % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1586406387, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s545202823.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s545202823", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a , b = io.read(\"*a\" , \"*b\")\nc = a * b\nif c % 2 > 0\n  then\n  print(\"Odd\")\n  else\n  print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s320764234", "group_id": "codeNet:p03455", "input_text": "local a , b = io.read(\"*a\" , \"*b\")\nc = a * b\nif c % 2 == 0\n  then\n  print(\"Even\")\n  else\n  print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1586406308, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s320764234.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s320764234", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a , b = io.read(\"*a\" , \"*b\")\nc = a * b\nif c % 2 == 0\n  then\n  print(\"Even\")\n  else\n  print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s219193531", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "language": "Lua", "metadata": {"date": 1586406198, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s219193531.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219193531", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 1016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s204954547", "group_id": "codeNet:p03455", "input_text": "a, b =io.read(\"*a\", \"*b\")\nif a*b % 2 > 0 \n  then \n    print(\"Odd\")\n  else\n    print(\"Even\")\n  end", "language": "Lua", "metadata": {"date": 1586406156, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s204954547.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s204954547", "user_id": "u936678048"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a, b =io.read(\"*a\", \"*b\")\nif a*b % 2 > 0 \n  then \n    print(\"Odd\")\n  else\n    print(\"Even\")\n  end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s693912588", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nprint((a % 2 == 1 and b % 2 == 1) and \"Odd\" or \"Even\")", "language": "Lua", "metadata": {"date": 1586394589, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s693912588.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693912588", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nprint((a % 2 == 1 and b % 2 == 1) and \"Odd\" or \"Even\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s666050039", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"n\", \"n\")\nif (~a & 1) | (~b & 1) == 1 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1580520496, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s666050039.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666050039", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"n\", \"n\")\nif (~a & 1) | (~b & 1) == 1 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s835928479", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nif a * b % 2 == 0 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1580520030, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s835928479.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835928479", "user_id": "u162773977"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nif a * b % 2 == 0 then\n  print(\"Even\")\nelse\n  print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s510816478", "group_id": "codeNet:p03455", "input_text": "local a,b=io.read(\"*n\",\"*n\")\nif a*b%2==1 then\n\treturn print \"Odd\"\nelse\n\treturn print \"Even\"\nend", "language": "Lua", "metadata": {"date": 1576448613, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s510816478.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510816478", "user_id": "u373958718"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b=io.read(\"*n\",\"*n\")\nif a*b%2==1 then\n\treturn print \"Odd\"\nelse\n\treturn print \"Even\"\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s830230884", "group_id": "codeNet:p03455", "input_text": "local a,b=io.read(\"*n\",\"*n\")\nif a*b%2==1 then\n\treturn print \"Odd\"\nelse\n\treturn print \"Even\"\nend", "language": "Lua", "metadata": {"date": 1576448595, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s830230884.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830230884", "user_id": "u373958718"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b=io.read(\"*n\",\"*n\")\nif a*b%2==1 then\n\treturn print \"Odd\"\nelse\n\treturn print \"Even\"\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s788187050", "group_id": "codeNet:p03455", "input_text": "local a,b = io.read(\"*n\", \"*n\")\nlocal multi = a * b\n\nif multi % 2 == 0 then\n    print(\"Even\")\nelse\n    print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1565519467, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s788187050.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788187050", "user_id": "u318027064"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b = io.read(\"*n\", \"*n\")\nlocal multi = a * b\n\nif multi % 2 == 0 then\n    print(\"Even\")\nelse\n    print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s046512752", "group_id": "codeNet:p03455", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"Even\"or\"Odd\")", "language": "Lua", "metadata": {"date": 1551838850, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s046512752.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046512752", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"Even\"or\"Odd\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s077833549", "group_id": "codeNet:p03455", "input_text": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"Even\"or\"Odd\")", "language": "Lua", "metadata": {"date": 1551838828, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s077833549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077833549", "user_id": "u837412668"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a,b=io.read():match(\"(.+)%s(.+)\")\nprint(a*b%2==0 and\"Even\"or\"Odd\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s719959712", "group_id": "codeNet:p03455", "input_text": "a=io.read(\"n\")\nb=io.read(\"n\")\nif (a*b)%2==0 then\n  print(\"Even\")\n  else\n  print(\"Odd\")\nend", "language": "Lua", "metadata": {"date": 1551126603, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s719959712.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719959712", "user_id": "u015229643"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "a=io.read(\"n\")\nb=io.read(\"n\")\nif (a*b)%2==0 then\n  print(\"Even\")\n  else\n  print(\"Odd\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s874801902", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "language": "Lua", "metadata": {"date": 1529108901, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s874801902.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s874801902", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s453006845", "group_id": "codeNet:p03455", "input_text": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "language": "Lua", "metadata": {"date": 1529108896, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s453006845.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453006845", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a, b = io.read(\"*n\", \"*n\")\nreturn print((function()\n  if a * b % 2 > 0 then\n    return \"Odd\"\n  else\n    return \"Even\"\n  end\nend)())", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s013019580", "group_id": "codeNet:p03455", "input_text": "local a,b = io.read(\"*n\",\"*n\")\nif a*b%2>0 then\n print(\"Odd\")\nelse\n print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1528867380, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s013019580.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013019580", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b = io.read(\"*n\",\"*n\")\nif a*b%2>0 then\n print(\"Odd\")\nelse\n print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s806846594", "group_id": "codeNet:p03455", "input_text": "local a,b = io.read(\"*n\",\"*n\")\nif a*b%2>0 then\n print(\"Odd\")\nelse\n print(\"Even\")\nend", "language": "Lua", "metadata": {"date": 1528867367, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s806846594.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806846594", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b = io.read(\"*n\",\"*n\")\nif a*b%2>0 then\n print(\"Odd\")\nelse\n print(\"Even\")\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s249085745", "group_id": "codeNet:p03455", "input_text": "local a,b = io.read(\"*n\",\"*n\")\nprint(a*b)", "language": "Lua", "metadata": {"date": 1528866972, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lua/s249085745.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s249085745", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "local a,b = io.read(\"*n\",\"*n\")\nprint(a*b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s954962556", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\ny=y//1000\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1590301812, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s954962556.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954962556", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\ny=y//1000\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s181724176", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\ny=y//1000\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend", "language": "Lua", "metadata": {"date": 1590301556, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s181724176.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s181724176", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\ny=y//1000\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s612326249", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend", "language": "Lua", "metadata": {"date": 1590301498, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s612326249.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s612326249", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\nfor a=0,n do\n    b=((y-10*a)-(n-a))//4\n    c=n-a-b\n    if b>=0 and c>=0 and 10*a+5*b+c==y then\n        print(a,b,c)\n        return\n    end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s087100961", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-(10000*i+5000*j)\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>=0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589260051, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s087100961.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s087100961", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-(10000*i+5000*j)\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>=0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1082, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s993476897", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-(10000*i+5000*j)\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589259977, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s993476897.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s993476897", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-(10000*i+5000*j)\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1064, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s167737469", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-10000*i+5000*j\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589259941, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s167737469.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s167737469", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-10000*i+5000*j\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n and x>0 then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1086, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s390868896", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-10000*i+5000*j\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589259837, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s390868896.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s390868896", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-10000*i+5000*j\n        k=(x%1000==0 and x//1000 or 2*n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1045, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s231760987", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-1000*i+5000*j\n        k=(x%10000==0 and x//10000 or 2*n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589259695, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s231760987.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231760987", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=0,n do\n    for j=0,n do\n        x=y-1000*i+5000*j\n        k=(x%10000==0 and x//10000 or 2*n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1031, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s997486188", "group_id": "codeNet:p03471", "input_text": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=1,n do\n    for j=1,n do\n        x=y-1000*i+5000*j\n        k=(x%10000==0 and x//10000 or n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "language": "Lua", "metadata": {"date": 1589259625, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s997486188.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s997486188", "user_id": "u045238009"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n,y=io.read(\"*n\",\"*n\")\n\nfor i=1,n do\n    for j=1,n do\n        x=y-1000*i+5000*j\n        k=(x%10000==0 and x//10000 or n)\n        if i+j+k==n then\n            print(i,j,k)\n            return\n        end\n    end\nend\nprint(-1,-1,-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 949, "memory_kb": 1132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s573591759", "group_id": "codeNet:p03471", "input_text": "local n, y = io.read(\"*n\", \"*n\")\n\nlocal result = {-1, -1, -1}\nfor i = 0, n do\n    for j = 0, n - i do\n        local k = n - i - j\n        if 10000*i + 5000*j + 1000*k == y then\n            result[1], result[2], result[3] = i, j, k\n        end\n    end\nend\n\nprint(table.concat(result, \" \"))", "language": "Lua", "metadata": {"date": 1586532462, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s573591759.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573591759", "user_id": "u793881115"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "local n, y = io.read(\"*n\", \"*n\")\n\nlocal result = {-1, -1, -1}\nfor i = 0, n do\n    for j = 0, n - i do\n        local k = n - i - j\n        if 10000*i + 5000*j + 1000*k == y then\n            result[1], result[2], result[3] = i, j, k\n        end\n    end\nend\n\nprint(table.concat(result, \" \"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 5, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s991815252", "group_id": "codeNet:p03471", "input_text": "n, k = io.read(\"*n\", \"*n\")\nk = k / 1000\nz = k % 5\nx, y = -1, -1\nwhile(z <= n) do\n    nt, kt = n - z, k - z\n    a = kt - nt * 5\n    if(a % 5 == 0) then\n        x = a / 5\n        if(x <= nt and 0 <= x) then\n            y = nt - x\n            break\n        end\n    end\n    z = z + 5\nend\nif(0 <= y) then io.write(string.format(\"%d %d %d\\n\", x, y, z)) else print(\"-1 -1 -1\") end\n", "language": "Lua", "metadata": {"date": 1555075075, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s991815252.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991815252", "user_id": "u120582723"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "n, k = io.read(\"*n\", \"*n\")\nk = k / 1000\nz = k % 5\nx, y = -1, -1\nwhile(z <= n) do\n    nt, kt = n - z, k - z\n    a = kt - nt * 5\n    if(a % 5 == 0) then\n        x = a / 5\n        if(x <= nt and 0 <= x) then\n            y = nt - x\n            break\n        end\n    end\n    z = z + 5\nend\nif(0 <= y) then io.write(string.format(\"%d %d %d\\n\", x, y, z)) else print(\"-1 -1 -1\") end\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 374, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678997076", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n      break\n    end\n  end\n  if x~=-1 then\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "language": "Lua", "metadata": {"date": 1551134716, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s678997076.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678997076", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n      break\n    end\n  end\n  if x~=-1 then\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 539, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s614472676", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n      break\n    end\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "language": "Lua", "metadata": {"date": 1551134648, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s614472676.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s614472676", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n      break\n    end\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 544, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s925895097", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "language": "Lua", "metadata": {"date": 1551134221, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s925895097.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s925895097", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s094210859", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(x,y,z)\n      ", "language": "Lua", "metadata": {"date": 1551134174, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s094210859.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s094210859", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=0,I do\n  for j=0,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(x,y,z)\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s899663782", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=1,I do\n  for j=1,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(x,y,z)\n      ", "language": "Lua", "metadata": {"date": 1551133952, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s899663782.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s899663782", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=1,I do\n  for j=1,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(x,y,z)\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 123, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s141630918", "group_id": "codeNet:p03471", "input_text": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=1,I do\n  for j=1,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "language": "Lua", "metadata": {"date": 1551133902, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s141630918.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s141630918", "user_id": "u015229643"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "N=io.read(\"n\")\nY=io.read(\"n\")\nlocal x=-1\nlocal y=-1\nlocal z=-1\nlocal I=Y//10000\nlocal J=Y//5000\nfor i=1,I do\n  for j=1,J do\n    if i+j<=N and i*10000+j*5000+(N-i-j)*1000==Y then\n      x=i\n      y=j\n      z=N-i-j\n    end\n    break\n  end\nend\nprint(string.format(\"%d %d %d\",x,y,z))\n      ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s867084712", "group_id": "codeNet:p03471", "input_text": "local n, y = io.read(\"*n\", \"*n\")\nfor i = 0, n do\n  for j = 0, n - i do\n    local k = n - i - j\n    if i * 1000 + j * 5000 + k * 10000 == y then\n      print(tostring(k) .. \" \" .. tostring(j) .. \" \" .. tostring(i))\n      return \n    end\n  end\nend\nreturn print(\"-1 -1 -1\")", "language": "Lua", "metadata": {"date": 1529109530, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s867084712.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s867084712", "user_id": "u280667879"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "local n, y = io.read(\"*n\", \"*n\")\nfor i = 0, n do\n  for j = 0, n - i do\n    local k = n - i - j\n    if i * 1000 + j * 5000 + k * 10000 == y then\n      print(tostring(k) .. \" \" .. tostring(j) .. \" \" .. tostring(i))\n      return \n    end\n  end\nend\nreturn print(\"-1 -1 -1\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 215, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s246390413", "group_id": "codeNet:p03471", "input_text": "local n, y = io.read(\"*n\", \"*n\")\nfor i = 0, n do\n  for j = 0, n - i do\n    local k = n - i - j\n    if i * 1000 + j * 5000 + k * 10000 == y then\n      print(tostring(k) .. \" \" .. tostring(j) .. \" \" .. tostring(i))\n      return \n    end\n  end\nend\nreturn print(\"-1 -1 -1\")", "language": "Lua", "metadata": {"date": 1529109524, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lua/s246390413.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s246390413", "user_id": "u280667879"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "local n, y = io.read(\"*n\", \"*n\")\nfor i = 0, n do\n  for j = 0, n - i do\n    local k = n - i - j\n    if i * 1000 + j * 5000 + k * 10000 == y then\n      print(tostring(k) .. \" \" .. tostring(j) .. \" \" .. tostring(i))\n      return \n    end\n  end\nend\nreturn print(\"-1 -1 -1\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s633369896", "group_id": "codeNet:p03472", "input_text": "local n,h=io.read(\"*n\",\"*n\")\nlocal a={}\nlocal b={}\nfor i=1,n do\n    a[i],b[i]=io.read(\"*n\",\"*n\")\nend\ntable.sort(a)\ntable.sort(b)\n\nlocal attack=0\nfor i=n,1,-1 do\n    if b[i]>=a[n] then\n        h=h-b[i]\n        attack=attack+1\n    end\n    if 0>=h then\n        print(attack)\n        return\n    end\nend\nprint(attack+math.ceil(h/a[n]))", "language": "Lua", "metadata": {"date": 1592196183, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lua/s633369896.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633369896", "user_id": "u045238009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "local n,h=io.read(\"*n\",\"*n\")\nlocal a={}\nlocal b={}\nfor i=1,n do\n    a[i],b[i]=io.read(\"*n\",\"*n\")\nend\ntable.sort(a)\ntable.sort(b)\n\nlocal attack=0\nfor i=n,1,-1 do\n    if b[i]>=a[n] then\n        h=h-b[i]\n        attack=attack+1\n    end\n    if 0>=h then\n        print(attack)\n        return\n    end\nend\nprint(attack+math.ceil(h/a[n]))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 133, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s695134977", "group_id": "codeNet:p03472", "input_text": "n, h = io.read(\"*n\", \"*n\")\nkatana = {}\namax = 0\nfor i = 1, n do\n  a, b = io.read(\"*n\", \"*n\")\n  katana[i] = {}\n  katana[i].a = a\n  katana[i].b = b\n  amax = math.max(amax, a)\nend\ntable.sort(katana, function(x, y)\n    return x.b > y.b\n  end\n)\ncnt = 0\nfor i = 1, n do\n  if(amax <= katana[i].b) then\n    cnt, h = cnt + 1, h - katana[i].b\n    if(h <= 0) then break end\n  end\nend\nif(0 < h) then\n  cnt = cnt + math.ceil(h / amax)\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1555116278, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lua/s695134977.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s695134977", "user_id": "u120582723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "n, h = io.read(\"*n\", \"*n\")\nkatana = {}\namax = 0\nfor i = 1, n do\n  a, b = io.read(\"*n\", \"*n\")\n  katana[i] = {}\n  katana[i].a = a\n  katana[i].b = b\n  amax = math.max(amax, a)\nend\ntable.sort(katana, function(x, y)\n    return x.b > y.b\n  end\n)\ncnt = 0\nfor i = 1, n do\n  if(amax <= katana[i].b) then\n    cnt, h = cnt + 1, h - katana[i].b\n    if(h <= 0) then break end\n  end\nend\nif(0 < h) then\n  cnt = cnt + math.ceil(h / amax)\nend\nprint(cnt)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 179, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s284185725", "group_id": "codeNet:p03472", "input_text": "N=io.read()\nH=io.read()\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read()\n  b[i]=io.read()\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=((H-s)//amax)+1+#c\nend\nprint(number)", "language": "Lua", "metadata": {"date": 1551138346, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lua/s284185725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s284185725", "user_id": "u015229643"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read()\nH=io.read()\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read()\n  b[i]=io.read()\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=((H-s)//amax)+1+#c\nend\nprint(number)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s333626817", "group_id": "codeNet:p03472", "input_text": "N=io.read(\"n\")\nH=io.read(\"n\")\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read(\"n\")\n  b[i]=io.read(\"n\")\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=((H-s)//amax)+1+#c\nend\nprint(number)", "language": "Lua", "metadata": {"date": 1551137456, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lua/s333626817.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s333626817", "user_id": "u015229643"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read(\"n\")\nH=io.read(\"n\")\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read(\"n\")\n  b[i]=io.read(\"n\")\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=((H-s)//amax)+1+#c\nend\nprint(number)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 2103, "memory_kb": 6620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s822309453", "group_id": "codeNet:p03472", "input_text": "N=io.read(\"n\")\nH=io.read(\"n\")\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read(\"n\")\n  b[i]=io.read(\"n\")\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=(H//amax)+1+#c\nend\nprint(number)", "language": "Lua", "metadata": {"date": 1551136936, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lua/s822309453.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s822309453", "user_id": "u015229643"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "N=io.read(\"n\")\nH=io.read(\"n\")\nlocal number\nlocal a={}\nlocal b={}\nfor i=1,N do\n  a[i]=io.read(\"n\")\n  b[i]=io.read(\"n\")\nend\nlocal amax=0\nfor i=1,N do\n  if a[i]>amax then\n    amax=a[i]\n  end\nend\nfor i=1,N do\n  if b[i]<amax then\n    table.remove(a,i)\n    table.remove(b,i)\n  end\nend\nlocal c={}\nfor i,v in ipairs(b) do\n  c[i]=v\nend\ntable.sort(c,function (a,b) return a>b end)\nlocal s=0\nfor i=1,#c do\n  s=s+c[i]\nend\nlocal t=0\nif s>=H then\n  for i=1,#c do\n    t=t+c[i]\n    if t>=H then\n      number=i\n    end\n    break\n  end\nelse\n  number=(H//amax)+1+#c\nend\nprint(number)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 2103, "memory_kb": 6620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s440367704", "group_id": "codeNet:p03478", "input_text": "N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nsumsum = 0\nfor i = 1, N do\n    i = \"0\"..tostring(i)\n    sum = 0\n    for j = 1, #i do\n        sum = sum + tonumber(i:sub(j,j))\n    end\n    if A <= sum and sum <= B then\n        sumsum = sumsum + i\n    end\nend\nprint(string.format(\"%d\", sumsum))", "language": "Lua", "metadata": {"date": 1587145796, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s440367704.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s440367704", "user_id": "u045238009"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nsumsum = 0\nfor i = 1, N do\n    i = \"0\"..tostring(i)\n    sum = 0\n    for j = 1, #i do\n        sum = sum + tonumber(i:sub(j,j))\n    end\n    if A <= sum and sum <= B then\n        sumsum = sumsum + i\n    end\nend\nprint(string.format(\"%d\", sumsum))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 20, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s057668907", "group_id": "codeNet:p03478", "input_text": "local function sumDigits(num)\n    local sum = 0\n    while num > 0 do\n        sum = sum + num % 10\n        num = math.modf(num / 10)\n    end\n    return sum\nend\n\nlocal N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nlocal total = 0\nfor i = 1, N do\n    local sum = sumDigits(i)\n    if sum >= A and sum <= B then\n        total = total + i\n    end\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1586467525, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s057668907.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s057668907", "user_id": "u793881115"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "local function sumDigits(num)\n    local sum = 0\n    while num > 0 do\n        sum = sum + num % 10\n        num = math.modf(num / 10)\n    end\n    return sum\nend\n\nlocal N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nlocal total = 0\nfor i = 1, N do\n    local sum = sumDigits(i)\n    if sum >= A and sum <= B then\n        total = total + i\n    end\nend\nprint(total)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s215018005", "group_id": "codeNet:p03478", "input_text": "local function sumDigits(num)\n    local sum = 0\n    while num > 0 do\n        sum = sum + num % 10\n        num = math.modf(num / 10)\n    end\n    return sum\nend\n\nlocal N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nlocal total = 0\nfor i = 1, N do\n    local sum = sumDigits(i)\n    if sum >= A and sum <= B then\n        total = total + 1\n    end\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1586466883, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s215018005.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s215018005", "user_id": "u793881115"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "local function sumDigits(num)\n    local sum = 0\n    while num > 0 do\n        sum = sum + num % 10\n        num = math.modf(num / 10)\n    end\n    return sum\nend\n\nlocal N, A, B = io.read(\"*n\", \"*n\", \"*n\")\nlocal total = 0\nfor i = 1, N do\n    local sum = sumDigits(i)\n    if sum >= A and sum <= B then\n        total = total + 1\n    end\nend\nprint(total)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s906820482", "group_id": "codeNet:p03478", "input_text": "local ior = io.read\nlocal n, a, b = ior(\"*n\", \"*n\", \"*n\")\n\nlocal function getsum(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\n\nlocal ret = 0\nfor i = 1, n do\n  local z = getsum(i)\n  if(a <= z and z <= b) then ret = ret + i end\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1556480386, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s906820482.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906820482", "user_id": "u120582723"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "local ior = io.read\nlocal n, a, b = ior(\"*n\", \"*n\", \"*n\")\n\nlocal function getsum(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\n\nlocal ret = 0\nfor i = 1, n do\n  local z = getsum(i)\n  if(a <= z and z <= b) then ret = ret + i end\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s413138028", "group_id": "codeNet:p03478", "input_text": "N=io.read(\"n\")\nA=io.read(\"n\")\nB=io.read(\"n\")\nfunction d(a)\n  local s=0\n  while (a>0) do\n    s=s+a%10\n    a=a//10\n  end\n  return s\nend\nlocal total=0\nfor i=1,N do\n  if d(i)>=A and d(i)<=B then\n    total=total+i\n  end\nend\nprint(total)", "language": "Lua", "metadata": {"date": 1551149682, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s413138028.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413138028", "user_id": "u015229643"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "N=io.read(\"n\")\nA=io.read(\"n\")\nB=io.read(\"n\")\nfunction d(a)\n  local s=0\n  while (a>0) do\n    s=s+a%10\n    a=a//10\n  end\n  return s\nend\nlocal total=0\nfor i=1,N do\n  if d(i)>=A and d(i)<=B then\n    total=total+i\n  end\nend\nprint(total)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s510041033", "group_id": "codeNet:p03478", "input_text": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = 0\nfor i = 1, n do\n  local s = 0\n  local j = i\n  while j > 0 do\n    s = s + (j % 10)\n    j = j / 10\n  end\n  if a <= s and s <= b then\n    r = r + i\n  end\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109422, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s510041033.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s510041033", "user_id": "u280667879"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = 0\nfor i = 1, n do\n  local s = 0\n  local j = i\n  while j > 0 do\n    s = s + (j % 10)\n    j = j / 10\n  end\n  if a <= s and s <= b then\n    r = r + i\n  end\nend\nreturn print(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s940770862", "group_id": "codeNet:p03478", "input_text": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = 0\nfor i = 1, n do\n  local s = 0\n  local j = i\n  while j > 0 do\n    s = s + (j % 10)\n    j = j // 10\n  end\n  if a <= s and s <= b then\n    r = r + i\n  end\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529109397, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lua/s940770862.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940770862", "user_id": "u280667879"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal r = 0\nfor i = 1, n do\n  local s = 0\n  local j = i\n  while j > 0 do\n    s = s + (j % 10)\n    j = j // 10\n  end\n  if a <= s and s <= b then\n    r = r + i\n  end\nend\nreturn print(r)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s678376926", "group_id": "codeNet:p03493", "input_text": "local s = io.read(\"*l\")\n\nlocal count = 0\ncount = count + ((s:sub(1, 1) == \"1\") and 1 or 0)\ncount = count + ((s:sub(2, 2) == \"1\") and 1 or 0)\ncount = count + ((s:sub(3, 3) == \"1\") and 1 or 0)\nprint(count)", "language": "Lua", "metadata": {"date": 1586396245, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s678376926.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678376926", "user_id": "u793881115"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local s = io.read(\"*l\")\n\nlocal count = 0\ncount = count + ((s:sub(1, 1) == \"1\") and 1 or 0)\ncount = count + ((s:sub(2, 2) == \"1\") and 1 or 0)\ncount = count + ((s:sub(3, 3) == \"1\") and 1 or 0)\nprint(count)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s408624666", "group_id": "codeNet:p03493", "input_text": "local ior = io.read\nlocal str = ior()\nlocal cnt = 0\nfor i = 1, 3 do\n  if(str:sub(i, i) == \"1\") then cnt = cnt + 1 end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1556481084, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s408624666.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408624666", "user_id": "u120582723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local ior = io.read\nlocal str = ior()\nlocal cnt = 0\nfor i = 1, 3 do\n  if(str:sub(i, i) == \"1\") then cnt = cnt + 1 end\nend\nprint(cnt)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s158308462", "group_id": "codeNet:p03493", "input_text": "a,b,c=io.read():match(\"(.)(.)(.)\")\nprint(math.floor(a+b+c))", "language": "Lua", "metadata": {"date": 1551838104, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s158308462.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s158308462", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.)(.)(.)\")\nprint(math.floor(a+b+c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s242809898", "group_id": "codeNet:p03493", "input_text": "a,b,c=io.read():match(\"(.)(.)(.)\")\nprint(math.floor(a+b+c))", "language": "Lua", "metadata": {"date": 1551838075, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s242809898.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s242809898", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.)(.)(.)\")\nprint(math.floor(a+b+c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s258155816", "group_id": "codeNet:p03493", "input_text": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(a+b+c))", "language": "Lua", "metadata": {"date": 1551838042, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s258155816.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s258155816", "user_id": "u837412668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "a,b,c=io.read():match(\"(.+)%s(.+)%s(.+)\")\nprint(math.floor(a+b+c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s922100297", "group_id": "codeNet:p03493", "input_text": "N=io.read()\nprint(string.sub(N,1,1)+string.sub(N,2,2)+string.sub(N,3,3))", "language": "Lua", "metadata": {"date": 1551221201, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s922100297.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s922100297", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read()\nprint(string.sub(N,1,1)+string.sub(N,2,2)+string.sub(N,3,3))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s601518042", "group_id": "codeNet:p03493", "input_text": "N=io.read()\nprint(N%10+(N//10)%10+N//100)", "language": "Lua", "metadata": {"date": 1551221051, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s601518042.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s601518042", "user_id": "u015229643"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "N=io.read()\nprint(N%10+(N//10)%10+N//100)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s412335463", "group_id": "codeNet:p03493", "input_text": "local l = io.read(\"*l\")\nlocal r = 0\nfor _ in l:gmatch(\"1\") do\n  r = r + 1\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529108943, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s412335463.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412335463", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l = io.read(\"*l\")\nlocal r = 0\nfor _ in l:gmatch(\"1\") do\n  r = r + 1\nend\nreturn print(r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s641597399", "group_id": "codeNet:p03493", "input_text": "local l = io.read(\"*l\")\nlocal r = 0\nfor _ in l:gmatch(\"1\") do\n  r = r + 1\nend\nreturn print(r)", "language": "Lua", "metadata": {"date": 1529108934, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lua/s641597399.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641597399", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "local l = io.read(\"*l\")\nlocal r = 0\nfor _ in l:gmatch(\"1\") do\n  r = r + 1\nend\nreturn print(r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s209139306", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S=\"\"\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        if S==\"\" then\n            S=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n            S=S:gsub(\"?\",\"a\")\n        else\n            local T=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n            T=T:gsub(\"?\",\"a\")\n            if S>T then\n                S=T\n            end\n        end\n    end\nend\n\nprint(#S>0 and S or \"UNRESTORABLE\")", "language": "Lua", "metadata": {"date": 1591319652, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s209139306.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s209139306", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S=\"\"\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        if S==\"\" then\n            S=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n            S=S:gsub(\"?\",\"a\")\n        else\n            local T=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n            T=T:gsub(\"?\",\"a\")\n            if S>T then\n                S=T\n            end\n        end\n    end\nend\n\nprint(#S>0 and S or \"UNRESTORABLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 606, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s877233260", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    local gsubS=subS:gsub(\"?\",\"\")\n    if flag and gsubS~=\"\" then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591319281, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s877233260.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s877233260", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    local gsubS=subS:gsub(\"?\",\"\")\n    if flag and gsubS~=\"\" then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 523, "cpu_time_ms": 5, "memory_kb": 752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s042071190", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag and subS:gsub(\"?\",\"\")~=\"\" then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591319061, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s042071190.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s042071190", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag and subS:gsub(\"?\",\"\")~=\"\" then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 501, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s543340976", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==\"?\" then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n            break\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591318237, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s543340976.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s543340976", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==\"?\" then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n            break\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 6, "memory_kb": 636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s374792135", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==\"?\" then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591318182, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s374792135.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s374792135", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==\"?\" then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 605, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s341476511", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    else\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591317223, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s341476511.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s341476511", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    else\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s464444316", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591316466, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s464444316.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s464444316", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=#S_dash-#T+1,1,-1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        break\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s086947039", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nlocal i=1\nwhile i<=#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        i=i+#T-1\n    else\n        i=i+1\n    end\nend\n\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591315540, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s086947039.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s086947039", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nlocal i=1\nwhile i<=#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n        i=i+#T-1\n    else\n        i=i+1\n    end\nend\n\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 2103, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s485369964", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591315177, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s485369964.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s485369964", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 459, "cpu_time_ms": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s689617385", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "language": "Lua", "metadata": {"date": 1591315119, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s689617385.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689617385", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal S_dash_copy=S_dash\nlocal T=io.read()\n\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    local flag=true\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nif S_dash==S_dash_copy then\n    print(\"UNRESTORABLE\")\nelse\n    S=S_dash:gsub(\"%?\",\"a\")\n    print(S)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s650971558", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal T=io.read()\n\nlocal flag=true\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nS=S_dash:gsub(\"%?\",\"a\")\nprint(flag and S or \"UNRESTORABLE\")", "language": "Lua", "metadata": {"date": 1591274688, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s650971558.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650971558", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal T=io.read()\n\nlocal flag=true\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nS=S_dash:gsub(\"%?\",\"a\")\nprint(flag and S or \"UNRESTORABLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 454, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s144737539", "group_id": "codeNet:p03565", "input_text": "local S_dash=io.read()\nlocal T=io.read()\n\nlocal S=\"\"\nlocal flag=true\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nS=S:gsub(\"%?\",\"a\")\nprint(flag and S or \"UNRESTORABLE\")", "language": "Lua", "metadata": {"date": 1591274447, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s144737539.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s144737539", "user_id": "u045238009"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S_dash=io.read()\nlocal T=io.read()\n\nlocal S=\"\"\nlocal flag=true\nfor i=1,#S_dash-#T+1 do\n    local subS=S_dash:sub(i,#T+i-1)\n    for j=1,#T do\n        if subS:sub(j,j)~=\"?\" and subS:sub(j,j)~=T:sub(j,j) then\n            flag=false\n        elseif subS:sub(j,j)==T:sub(j,j) then\n            flag=true\n        end\n    end\n    if flag then\n        S=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)\n    end\nend\nS=S:gsub(\"%?\",\"a\")\nprint(flag and S or \"UNRESTORABLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 455, "cpu_time_ms": 13, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s176323598", "group_id": "codeNet:p03565", "input_text": "local S, T = io.read(\"l\",\"l\")\nlocal function match(i)\n    local ss = S:sub(i, i+#T-1)\n    for k=1,#T do\n        local c = ss:sub(k,k)\n        local d = T:sub(k,k)\n        if c == '?' then\n        elseif c == d then\n        else\n            return false\n        end\n    end\n    return true\nend\nfor i=#S-#T+1,1,-1 do\n    if match(i) then\n        local t = {}\n        for k=1,i-1 do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        for k=i,i+#T-1 do\n            table.insert(t, T:sub(k-i+1,k-i+1))\n        end\n        for k=i+#T,#S do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        print(table.concat(t, \"\"))\n        return\n    end\nend\nprint(\"UNRESTORABLE\")", "language": "Lua", "metadata": {"date": 1573935131, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s176323598.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176323598", "user_id": "u162773977"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S, T = io.read(\"l\",\"l\")\nlocal function match(i)\n    local ss = S:sub(i, i+#T-1)\n    for k=1,#T do\n        local c = ss:sub(k,k)\n        local d = T:sub(k,k)\n        if c == '?' then\n        elseif c == d then\n        else\n            return false\n        end\n    end\n    return true\nend\nfor i=#S-#T+1,1,-1 do\n    if match(i) then\n        local t = {}\n        for k=1,i-1 do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        for k=i,i+#T-1 do\n            table.insert(t, T:sub(k-i+1,k-i+1))\n        end\n        for k=i+#T,#S do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        print(table.concat(t, \"\"))\n        return\n    end\nend\nprint(\"UNRESTORABLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s412039561", "group_id": "codeNet:p03565", "input_text": "local S, T = io.read(\"l\",\"l\")\nlocal function match(i)\n    local ss = S:sub(i, i+#T-1)\n    for k=1,#T do\n        local c = ss:sub(k,k)\n        local d = T:sub(k,k)\n        if c == '?' then\n        elseif c == d then\n        else\n            return false\n        end\n    end\n    return true\nend\nfor i=1,#S-#T+1 do\n    if match(i) then\n        local t = {}\n        for k=1,i-1 do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        for k=i,i+#T-1 do\n            table.insert(t, T:sub(k-i+1,k-i+1))\n        end\n        for k=i+#T,#S do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        print(table.concat(t, \"\"))\n        return\n    end\nend\nprint(\"UNRESTORABLE\")", "language": "Lua", "metadata": {"date": 1573935030, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s412039561.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s412039561", "user_id": "u162773977"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local S, T = io.read(\"l\",\"l\")\nlocal function match(i)\n    local ss = S:sub(i, i+#T-1)\n    for k=1,#T do\n        local c = ss:sub(k,k)\n        local d = T:sub(k,k)\n        if c == '?' then\n        elseif c == d then\n        else\n            return false\n        end\n    end\n    return true\nend\nfor i=1,#S-#T+1 do\n    if match(i) then\n        local t = {}\n        for k=1,i-1 do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        for k=i,i+#T-1 do\n            table.insert(t, T:sub(k-i+1,k-i+1))\n        end\n        for k=i+#T,#S do\n            local c = S:sub(k,k)\n            if c == '?' then\n                table.insert(t, 'a')\n            else\n                table.insert(t, c)\n            end\n        end\n        print(table.concat(t, \"\"))\n        return\n    end\nend\nprint(\"UNRESTORABLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 929, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s308146767", "group_id": "codeNet:p03565", "input_text": "local a = io.read()\nlocal b = io.read()\nlocal alen, blen = #a, #b\nlocal ret = nil\n\nfor i = 1, alen + 1 - blen do\n  local accept = true\n  for j = i, i + blen - 1 do\n    local jb = j - i + 1\n    local as, bs = a:sub(j, j), b:sub(jb, jb)\n    if as ~= \"?\" and as ~= bs then\n      accept = false break\n    end\n  end\n  if accept then\n    local str = \"\"\n    for j = 1, alen do\n      local jb = j - i + 1\n      if jb < 1 or blen < jb then\n        local as = a:sub(j, j)\n        if as == \"?\" then as = \"a\" end\n        str = str .. as\n      else\n        str = str .. b:sub(jb, jb)\n      end\n    end\n    if not ret then\n      ret = str\n    elseif str < ret then\n      ret = str\n    end\n  end\nend\nif not ret then print(\"UNRESTORABLE\")\nelse print(ret) end\n", "language": "Lua", "metadata": {"date": 1561257816, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s308146767.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s308146767", "user_id": "u120582723"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "local a = io.read()\nlocal b = io.read()\nlocal alen, blen = #a, #b\nlocal ret = nil\n\nfor i = 1, alen + 1 - blen do\n  local accept = true\n  for j = i, i + blen - 1 do\n    local jb = j - i + 1\n    local as, bs = a:sub(j, j), b:sub(jb, jb)\n    if as ~= \"?\" and as ~= bs then\n      accept = false break\n    end\n  end\n  if accept then\n    local str = \"\"\n    for j = 1, alen do\n      local jb = j - i + 1\n      if jb < 1 or blen < jb then\n        local as = a:sub(j, j)\n        if as == \"?\" then as = \"a\" end\n        str = str .. as\n      else\n        str = str .. b:sub(jb, jb)\n      end\n    end\n    if not ret then\n      ret = str\n    elseif str < ret then\n      ret = str\n    end\n  end\nend\nif not ret then print(\"UNRESTORABLE\")\nelse print(ret) end\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 743, "cpu_time_ms": 7, "memory_kb": 880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s055469579", "group_id": "codeNet:p03565", "input_text": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>=t do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n      \t\ts=s+#T-t-1\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "language": "Lua", "metadata": {"date": 1551832949, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s055469579.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055469579", "user_id": "u015229643"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>=t do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n      \t\ts=s+#T-t-1\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s195077485", "group_id": "codeNet:p03565", "input_text": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>=t do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "language": "Lua", "metadata": {"date": 1551831370, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s195077485.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195077485", "user_id": "u015229643"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>=t do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 625, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s305230127", "group_id": "codeNet:p03565", "input_text": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>0 do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "language": "Lua", "metadata": {"date": 1551830038, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s305230127.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s305230127", "user_id": "u015229643"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "S=io.read()\nT=io.read()\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>0 do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 624, "cpu_time_ms": 5, "memory_kb": 376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s934393072", "group_id": "codeNet:p03565", "input_text": "S=io.read()\nT=io.read()\nprint(S,T)\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>0 do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "language": "Lua", "metadata": {"date": 1551829953, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s934393072.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s934393072", "user_id": "u015229643"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "S=io.read()\nT=io.read()\nprint(S,T)\nlocal s=#S\nlocal t=#T\nlocal res=false\nlocal q=0\nlocal news\nlocal ans\nwhile s>0 do\n    if string.sub(S,s,s)==\"?\" or string.sub(S,s,s)==string.sub(T,t,t) then\n        t=t-1\n        if t==0 then\n            q=s\n            res=true\n            news=string.sub(S,1,q-1)..T..string.sub(S,q+#T,#S)\n            ans=string.gsub(news,\"?\",\"a\")\n            print(ans)\n        end\n        if string.sub(S,s-1,s-1)~=\"?\" and string.sub(S,s-1,s-1)~=string.sub(T,t,t) then\n            t=#T\n        end\n    end\n    s=s-1\n    if res==true then\n        break\n    end\nend\nif res==false then\n    print(\"UNRESTORABLE\")\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 635, "cpu_time_ms": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s443019151", "group_id": "codeNet:p03565", "input_text": "s, t = io.read('*l'), io.read('*l')\n\nans = nil\n\nfor i = 1, #s - #t + 1 do\n    local ss = s:sub(1, i - 1) .. t .. s:sub(i + #t)\n    local valid = true\n    for j = 1, #s do\n        if s:byte(j) ~= 63 and s:byte(j) ~= ss:byte(j) then\n            valid = false; break\n        end\n    end\n    if valid then\n        local t = ss:gsub('?', 'a')\n        if ans == nil or ans > t then ans = t end\n    end\nend\n\nprint(ans or 'UNRESTORABLE')\n", "language": "Lua", "metadata": {"date": 1509240290, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lua/s443019151.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443019151", "user_id": "u785421275"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "s, t = io.read('*l'), io.read('*l')\n\nans = nil\n\nfor i = 1, #s - #t + 1 do\n    local ss = s:sub(1, i - 1) .. t .. s:sub(i + #t)\n    local valid = true\n    for j = 1, #s do\n        if s:byte(j) ~= 63 and s:byte(j) ~= ss:byte(j) then\n            valid = false; break\n        end\n    end\n    if valid then\n        local t = ss:gsub('?', 'a')\n        if ans == nil or ans > t then ans = t end\n    end\nend\n\nprint(ans or 'UNRESTORABLE')\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists 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 string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 366, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s588199652", "group_id": "codeNet:p03574", "input_text": "h,w=io.read(\"*n\",\"*n\",\"*l\")\ns={}\nfor i=1,h+2 do\n    s[i]={}\n    if i~=1 and i~=h+2 then\n        x=io.read()\n    end\n    for j=1,w+2 do\n        if i==1 or i==h+2 then\n            s[i][j]=\".\"\n        else\n            if j==1 or j==w+2 then\n                s[i][j]=\".\"\n            else\n                s[i][j]=x:sub(j-1,j-1)\n            end\n        end\n    end\nend\n\nfor i=2,h+1 do\n    for j=2,w+1 do\n        if s[i][j]==\".\" then\n            bom_counter=0\n            for k=i-1,i+1 do\n                for l=j-1,j+1 do\n                    if s[k][l]==\"#\" then\n                        bom_counter=bom_counter+1\n                    end\n                end\n            end\n            s[i][j]=bom_counter\n        end\n    end\nend\n\nfor i=2,h+1 do\n    print(table.concat(s[i],\"\",2,w+1))\nend", "language": "Lua", "metadata": {"date": 1589041523, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lua/s588199652.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s588199652", "user_id": "u045238009"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "h,w=io.read(\"*n\",\"*n\",\"*l\")\ns={}\nfor i=1,h+2 do\n    s[i]={}\n    if i~=1 and i~=h+2 then\n        x=io.read()\n    end\n    for j=1,w+2 do\n        if i==1 or i==h+2 then\n            s[i][j]=\".\"\n        else\n            if j==1 or j==w+2 then\n                s[i][j]=\".\"\n            else\n                s[i][j]=x:sub(j-1,j-1)\n            end\n        end\n    end\nend\n\nfor i=2,h+1 do\n    for j=2,w+1 do\n        if s[i][j]==\".\" then\n            bom_counter=0\n            for k=i-1,i+1 do\n                for l=j-1,j+1 do\n                    if s[k][l]==\"#\" then\n                        bom_counter=bom_counter+1\n                    end\n                end\n            end\n            s[i][j]=bom_counter\n        end\n    end\nend\n\nfor i=2,h+1 do\n    print(table.concat(s[i],\"\",2,w+1))\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 779, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s864452594", "group_id": "codeNet:p03574", "input_text": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, (w + 2) * (h + 2) do t[i] = \".\" end\nfor i = 2, h + 1 do\n  local s = io.read()\n  for j = 2, w + 1 do\n    t[(i - 1) * (w + 2) + j] = s:sub(j - 1, j - 1)\n  end\nend\nfor i = 2, h + 1 do\n  for j = 2, w + 1 do\n    local idx = (i - 1) * (w + 2) + j\n    if t[idx] == \".\" then\n      local cnt = 0\n      local lis = {- w - 3, -w - 2, -w  - 1, -1, 1, w + 1, w + 2, w + 3}\n      for k = 1, #lis do\n        if t[idx + lis[k]] == \"#\" then\n          cnt = cnt + 1\n        end\n      end\n      io.write(cnt)\n    else\n      io.write(\"#\")\n    end\n  end\n  io.write(\"\\n\")\nend\n", "language": "Lua", "metadata": {"date": 1567604433, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lua/s864452594.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864452594", "user_id": "u120582723"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "local h, w = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, (w + 2) * (h + 2) do t[i] = \".\" end\nfor i = 2, h + 1 do\n  local s = io.read()\n  for j = 2, w + 1 do\n    t[(i - 1) * (w + 2) + j] = s:sub(j - 1, j - 1)\n  end\nend\nfor i = 2, h + 1 do\n  for j = 2, w + 1 do\n    local idx = (i - 1) * (w + 2) + j\n    if t[idx] == \".\" then\n      local cnt = 0\n      local lis = {- w - 3, -w - 2, -w  - 1, -1, 1, w + 1, w + 2, w + 3}\n      for k = 1, #lis do\n        if t[idx + lis[k]] == \"#\" then\n          cnt = cnt + 1\n        end\n      end\n      io.write(cnt)\n    else\n      io.write(\"#\")\n    end\n  end\n  io.write(\"\\n\")\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 617, "cpu_time_ms": 8, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s921060898", "group_id": "codeNet:p03574", "input_text": "n, m = io.read('n'), io.read('n'), io.read('l')\ns = {}\nfor i = 1, n do s[i] = io.read('l') end\nans = {}\nfor i = 1, n do ans[i] = {} end\n\nlocal BAKU = 35\nlocal AKI = 46\nlocal MOV = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}\n\nfor i = 1, n do\n    for j = 1, m do\n        if s[i]:byte(j) == AKI then\n            local count = 0\n            for k = 1, #MOV do\n                local ni, nj = i + MOV[k][1], j + MOV[k][2]\n                if ni >= 1 and ni <= n and nj >= 1 and nj <= m and\n                    s[ni]:byte(nj) == BAKU\n                then\n                    count = count + 1\n                end\n            end\n            ans[i][j] = string.char(48 + count)\n        else\n            ans[i][j] = '#'\n        end\n    end\nend\n\nfor i = 1, n do\n    for j = 1, m do io.write(ans[i][j]) end\n    io.write('\\n')\nend\n", "language": "Lua", "metadata": {"date": 1508036508, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lua/s921060898.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921060898", "user_id": "u785421275"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "n, m = io.read('n'), io.read('n'), io.read('l')\ns = {}\nfor i = 1, n do s[i] = io.read('l') end\nans = {}\nfor i = 1, n do ans[i] = {} end\n\nlocal BAKU = 35\nlocal AKI = 46\nlocal MOV = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}\n\nfor i = 1, n do\n    for j = 1, m do\n        if s[i]:byte(j) == AKI then\n            local count = 0\n            for k = 1, #MOV do\n                local ni, nj = i + MOV[k][1], j + MOV[k][2]\n                if ni >= 1 and ni <= n and nj >= 1 and nj <= m and\n                    s[ni]:byte(nj) == BAKU\n                then\n                    count = count + 1\n                end\n            end\n            ans[i][j] = string.char(48 + count)\n        else\n            ans[i][j] = '#'\n        end\n    end\nend\n\nfor i = 1, n do\n    for j = 1, m do io.write(ans[i][j]) end\n    io.write('\\n')\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\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 H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s566508540", "group_id": "codeNet:p03606", "input_text": "n,a=io.read('n'),0 for i=1,n do a=a+1-io.read('n')+io.read('n')end print(a)", "language": "Lua", "metadata": {"date": 1505011507, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lua/s566508540.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566508540", "user_id": "u785421275"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "n,a=io.read('n'),0 for i=1,n do a=a+1-io.read('n')+io.read('n')end print(a)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 91, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s762560725", "group_id": "codeNet:p03624", "input_text": "local S = io.read(\"*l\")\n\nlocal abc = \"abcdefghijklmnopqrstuvwxyz\"\nlocal have_abc_s = {}\nfor i = 1, abc:len()  do\n\thave_abc_s[abc:byte(i)] = false\nend\n\nfor i = 1, S:len() do\n\thave_abc_s[S:byte(i)] = true\nend\n\nlocal out = \"None\"\nfor i = 1, abc:len() do\n\tif not have_abc_s[abc:byte(i)] then\n\t\tout = abc:sub(i, i)\n\t\tbreak\n\tend\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1594392089, "filename_ext": "lua", "original_language": "Lua (LuaJIT 2.1.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s762560725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762560725", "user_id": "u793881115"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local S = io.read(\"*l\")\n\nlocal abc = \"abcdefghijklmnopqrstuvwxyz\"\nlocal have_abc_s = {}\nfor i = 1, abc:len()  do\n\thave_abc_s[abc:byte(i)] = false\nend\n\nfor i = 1, S:len() do\n\thave_abc_s[S:byte(i)] = true\nend\n\nlocal out = \"None\"\nfor i = 1, abc:len() do\n\tif not have_abc_s[abc:byte(i)] then\n\t\tout = abc:sub(i, i)\n\t\tbreak\n\tend\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 339, "cpu_time_ms": 5, "memory_kb": 2676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s545401564", "group_id": "codeNet:p03624", "input_text": "S = io.read()\nT = {}\nfor i = 1, 26 do\n    T[i] = false\nend\nfor i = 1, #S do\n    AtoI = S:sub(i, i):byte() - 96\n    T[AtoI] = true\nend\n\nflag = true\nfor i = 1, 26 do    \n    if not T[i] then\n        print(string.char(96+i))\n        flag = false\n        break\n    end\nend\nif flag then\n    print(\"None\")\nend", "language": "Lua", "metadata": {"date": 1587088992, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s545401564.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s545401564", "user_id": "u045238009"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "S = io.read()\nT = {}\nfor i = 1, 26 do\n    T[i] = false\nend\nfor i = 1, #S do\n    AtoI = S:sub(i, i):byte() - 96\n    T[AtoI] = true\nend\n\nflag = true\nfor i = 1, 26 do    \n    if not T[i] then\n        print(string.char(96+i))\n        flag = false\n        break\n    end\nend\nif flag then\n    print(\"None\")\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s195313144", "group_id": "codeNet:p03624", "input_text": "S = io.read()\nT = {}\nfor i = 1, 26 do\n    T[i] = false\nend\nfor i = 1, #S do\n    AtoI = S:sub(i, i):byte() - 96\n    T[AtoI] = true\nend\nfor i = 1, 26 do\n    flag = true\n    if not T[i] then\n        print(string.char(96+i))\n        flag = false\n        break\n    end\n    if flag then\n        print(\"None\")\n    end\nend", "language": "Lua", "metadata": {"date": 1587088943, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s195313144.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195313144", "user_id": "u045238009"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "S = io.read()\nT = {}\nfor i = 1, 26 do\n    T[i] = false\nend\nfor i = 1, #S do\n    AtoI = S:sub(i, i):byte() - 96\n    T[AtoI] = true\nend\nfor i = 1, 26 do\n    flag = true\n    if not T[i] then\n        print(string.char(96+i))\n        flag = false\n        break\n    end\n    if flag then\n        print(\"None\")\n    end\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s922895373", "group_id": "codeNet:p03624", "input_text": "local s = io.read()\nlocal t = {}\nfor i = 1, 26 do\n  t[i] = false\nend\nfor i = 1, #s do\n  local z = s:sub(i, i):byte() - 96\n  t[z] = true\nend\nlocal f = true\nfor i = 1, 26 do\n  if not t[i] then print(string.char(96 + i)) f = false break end\nend\nif f then print(\"None\") end\n", "language": "Lua", "metadata": {"date": 1584280661, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s922895373.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s922895373", "user_id": "u120582723"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local s = io.read()\nlocal t = {}\nfor i = 1, 26 do\n  t[i] = false\nend\nfor i = 1, #s do\n  local z = s:sub(i, i):byte() - 96\n  t[z] = true\nend\nlocal f = true\nfor i = 1, 26 do\n  if not t[i] then print(string.char(96 + i)) f = false break end\nend\nif f then print(\"None\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 23, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s353101047", "group_id": "codeNet:p03624", "input_text": "local s = io.read()\nlocal n = #s\nlocal t = {}\nfor i = 1, n do\n  t[i] = s:byte(i, i)\nend\nlocal alpha = {}\nfor i = 1, 26 do alpha[i] = false end\nfor i = 1, n do\n  alpha[t[i] - 96] = true\nend\nlocal found = false\nfor i = 1, 26 do\n  if not alpha[i] then\n    print(string.char(96 + i))\n    found = true\n    break\n  end\nend\nif not found then print(\"None\") end\n", "language": "Lua", "metadata": {"date": 1558288234, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s353101047.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353101047", "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\n  t[i] = s:byte(i, i)\nend\nlocal alpha = {}\nfor i = 1, 26 do alpha[i] = false end\nfor i = 1, n do\n  alpha[t[i] - 96] = true\nend\nlocal found = false\nfor i = 1, 26 do\n  if not alpha[i] then\n    print(string.char(96 + i))\n    found = true\n    break\n  end\nend\nif not found then print(\"None\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 2, "memory_kb": 1664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s495156679", "group_id": "codeNet:p03624", "input_text": "local s = io.read()\nlocal n = #s\nlocal t = {s:byte(1, n)}\nlocal alpha = {}\nfor i = 1, 26 do alpha[i] = false end\nfor i = 1, n do\n  alpha[t[i] - 96] = true\nend\nlocal found = false\nfor i = 1, 26 do\n  if not alpha[i] then\n    print(string.char(96 + i))\n    found = true\n    break\n  end\nend\nif not found then print(\"None\") end\n", "language": "Lua", "metadata": {"date": 1558288111, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lua/s495156679.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s495156679", "user_id": "u120582723"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal t = {s:byte(1, n)}\nlocal alpha = {}\nfor i = 1, 26 do alpha[i] = false end\nfor i = 1, n do\n  alpha[t[i] - 96] = true\nend\nlocal found = false\nfor i = 1, 26 do\n  if not alpha[i] then\n    print(string.char(96 + i))\n    found = true\n    break\n  end\nend\nif not found then print(\"None\") end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string 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 lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s251954934", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count == n then\n\tsum_count = n\nelseif two_times_count >= 1 then\n\tsum_count = four_times_count * 2 + two_times_count\nelse\n\tsum_count = four_times_count * 2 + 1\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599456226, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s251954934.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s251954934", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count == n then\n\tsum_count = n\nelseif two_times_count >= 1 then\n\tsum_count = four_times_count * 2 + two_times_count\nelse\n\tsum_count = four_times_count * 2 + 1\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 514, "cpu_time_ms": 36, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s019284901", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count == n then\n\tsum_count = n\nelseif two_times_count >= 1 then\n\tsum_count = four_times_count * 3 - 1 + two_times_count\nelse\n\tsum_count = four_times_count * 3\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599455394, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s019284901.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s019284901", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count == n then\n\tsum_count = n\nelseif two_times_count >= 1 then\n\tsum_count = four_times_count * 3 - 1 + two_times_count\nelse\n\tsum_count = four_times_count * 3\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 514, "cpu_time_ms": 37, "memory_kb": 2648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s412748296", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count ~= n and two_times_count > 1 then\n\tsum_count = four_times_count * 3 - 1 - two_times_count\nelseif two_times_count > 1 then\n\tsum_count = n\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599454848, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s412748296.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s412748296", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal four_times_count = 0\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tfour_times_count = four_times_count + 1\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nlocal sum_count = 0\nif two_times_count ~= n and two_times_count > 1 then\n\tsum_count = four_times_count * 3 - 1 - two_times_count\nelseif two_times_count > 1 then\n\tsum_count = n\nend\n\nprint((sum_count >= n) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 2652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s677007725", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= n and two_times_count > 1 then\n\tn_minus = n_minus - two_times_count + 1\nelseif two_times_count > 1 then\n\tn_minus = 0\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599453516, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s677007725.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s677007725", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= n and two_times_count > 1 then\n\tn_minus = n_minus - two_times_count + 1\nelseif two_times_count > 1 then\n\tn_minus = 0\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 2552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s643672810", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= n and two_times_count > 1 then\n\tn_minus = n_minus - two_times_count + 1\nelse\n\tn_minus = 0\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599453340, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s643672810.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s643672810", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= n and two_times_count > 1 then\n\tn_minus = n_minus - two_times_count + 1\nelse\n\tn_minus = 0\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 39, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s618420784", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= 0 then\n\tn_minus = n_minus - two_times_count + 1\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599452834, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s618420784.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s618420784", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count ~= 0 then\n\tn_minus = n_minus - two_times_count + 1\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 363, "cpu_time_ms": 40, "memory_kb": 2652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s551169817", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count == 0 then\nelseif two_times_count % 2 == 0 then\n\tn_minus = n_minus - two_times_count\nelseif two_times_count % 2 == 1 then\n\tn_minus = n_minus - (two_times_count - 1)\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599452307, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s551169817.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s551169817", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count == 0 then\nelseif two_times_count % 2 == 0 then\n\tn_minus = n_minus - two_times_count\nelseif two_times_count % 2 == 1 then\n\tn_minus = n_minus - (two_times_count - 1)\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 2676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s820421076", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count == 0 then\nelseif two_times_count % 2 == 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nelseif two_times_count % 2 == 1 then\n\tn_minus = n_minus - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599452032, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s820421076.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s820421076", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count == 0 then\nelseif two_times_count % 2 == 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nelseif two_times_count % 2 == 1 then\n\tn_minus = n_minus - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 492, "cpu_time_ms": 38, "memory_kb": 2628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s285684490", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count // 2 > 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599451788, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s285684490.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s285684490", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count // 2 > 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 2628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s641886709", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count > 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599451433, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s641886709.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s641886709", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nif two_times_count > 0 then\n\tn_minus = n_minus + 1 - two_times_count // 2 * 2\nend\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 37, "memory_kb": 2600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s881792610", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nn_minus = n_minus - two_times_count // 2 * 2\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599451081, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s881792610.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s881792610", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\n\nlocal n_minus = n\nlocal two_times_count = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 == 0 then\n\t\tn_minus = n_minus - 3\n\telseif a_i % 2 == 0 then\n\t\ttwo_times_count = two_times_count + 1\n\tend\nend\n\nn_minus = n_minus - two_times_count // 2 * 2\n\nprint((n_minus <= 0) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 2664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s002886361", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\nlocal found_4_amount = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tfound_4_amount = found_4_amount + 1\n\tend\nend\n\nif found_4_amount == 0 then\n\tprint(\"No\")\nelse\n\tprint(((n + found_4_amount - 1) // found_4_amount <= 3) and \"Yes\" or \"No\")\nend\n", "language": "Lua", "metadata": {"date": 1599450266, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s002886361.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002886361", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\nlocal found_4_amount = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tfound_4_amount = found_4_amount + 1\n\tend\nend\n\nif found_4_amount == 0 then\n\tprint(\"No\")\nelse\n\tprint(((n + found_4_amount - 1) // found_4_amount <= 3) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 2680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s422203602", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\nlocal found_4_amount = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tfound_4_amount = found_4_amount + 1\n\tend\nend\n\nprint((n / found_4_amount <= 3) and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599450036, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s422203602.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s422203602", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\nlocal found_4_amount = 0\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tfound_4_amount = found_4_amount + 1\n\tend\nend\n\nprint((n / found_4_amount <= 3) and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 2620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s174745489", "group_id": "codeNet:p03639", "input_text": "local read = io.read\n\nlocal n = read(\"n\")\nlocal is_found_4_times = false\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tis_found_4_times = true\n\t\tbreak\n\tend\nend\n\nprint(is_found_4_times and \"Yes\" or \"No\")\n", "language": "Lua", "metadata": {"date": 1599449439, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s174745489.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s174745489", "user_id": "u793881115"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "local read = io.read\n\nlocal n = read(\"n\")\nlocal is_found_4_times = false\nfor i = 1, n do\n\tlocal a_i = read(\"n\")\n\tif a_i % 4 ==0 then\n\t\tis_found_4_times = true\n\t\tbreak\n\tend\nend\n\nprint(is_found_4_times and \"Yes\" or \"No\")\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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 35, "memory_kb": 2596}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s452003074", "group_id": "codeNet:p03639", "input_text": "n=io.read(\"*n\", \"*l\")\nodd=0\nfour=0\nfor i=1, n do\n    a=io.read(\"*n\")\n    if a%2==1 then\n        odd=odd+1\n    elseif a%4==0 then\n        four=four+1\n    end\nend\n\nif four==odd-1 and four+odd==n then\n    print(\"Yes\")\nelseif four==odd then\n    print(\"Yes\")\nelseif four==n then\n    print(\"Yes\")\nelse \n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1589258593, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s452003074.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s452003074", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\", \"*l\")\nodd=0\nfour=0\nfor i=1, n do\n    a=io.read(\"*n\")\n    if a%2==1 then\n        odd=odd+1\n    elseif a%4==0 then\n        four=four+1\n    end\nend\n\nif four==odd-1 and four+odd==n then\n    print(\"Yes\")\nelseif four==odd then\n    print(\"Yes\")\nelseif four==n then\n    print(\"Yes\")\nelse \n    print(\"No\")\nend", "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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 43, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s168496920", "group_id": "codeNet:p03639", "input_text": "n=io.read(\"*n\", \"*l\")\nodd=0\nfour=0\nfor i=1, n do\n    a=io.read(\"*n\")\n    if a%2==1 then\n        odd=odd+1\n    elseif a%4==0 then\n        four=four+1\n    end\nend\n\nif four==odd-1 and four+odd==n then\n    print(\"Yes\")\nelseif four==odd then\n    print(\"Yes\")\nelse \n    print(\"No\")\nend", "language": "Lua", "metadata": {"date": 1589258466, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Lua/s168496920.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s168496920", "user_id": "u045238009"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "n=io.read(\"*n\", \"*l\")\nodd=0\nfour=0\nfor i=1, n do\n    a=io.read(\"*n\")\n    if a%2==1 then\n        odd=odd+1\n    elseif a%4==0 then\n        four=four+1\n    end\nend\n\nif four==odd-1 and four+odd==n then\n    print(\"Yes\")\nelseif four==odd then\n    print(\"Yes\")\nelse \n    print(\"No\")\nend", "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": "p03639", "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": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 279, "cpu_time_ms": 47, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s359031899", "group_id": "codeNet:p03705", "input_text": "local n, a, b = io.read(\"n\", \"n\", \"n\")\n\nif n == 1 and a == b then\n\tprint(1)\n\tos.exit()\nelseif n == 1 then\n\tprint(0)\n\tos.exit()\nelseif a > b then\n\tprint(0)\n\tos.exit()\nend\n\nprint((n - 2) * (b - a) + 1)\n", "language": "Lua", "metadata": {"date": 1600229204, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s359031899.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359031899", "user_id": "u793881115"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n, a, b = io.read(\"n\", \"n\", \"n\")\n\nif n == 1 and a == b then\n\tprint(1)\n\tos.exit()\nelseif n == 1 then\n\tprint(0)\n\tos.exit()\nelseif a > b then\n\tprint(0)\n\tos.exit()\nend\n\nprint((n - 2) * (b - a) + 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 5, "memory_kb": 2760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s543518602", "group_id": "codeNet:p03705", "input_text": "n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nmax=a+(n-1)*b\nmin=(n-1)*a+b\nif max-min+1>0 then\n    print(max-min+1)\nelse\n    print(0)\nend", "language": "Lua", "metadata": {"date": 1589245711, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s543518602.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s543518602", "user_id": "u045238009"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n,a,b=io.read(\"*n\",\"*n\",\"*n\")\nmax=a+(n-1)*b\nmin=(n-1)*a+b\nif max-min+1>0 then\n    print(max-min+1)\nelse\n    print(0)\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s505103941", "group_id": "codeNet:p03705", "input_text": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal min = a * (n - 1) + b\nlocal max = b * (n - 1) + a\nprint(math.max(0, max - min + 1))\n", "language": "Lua", "metadata": {"date": 1563248859, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s505103941.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s505103941", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n, a, b = io.read(\"*n\", \"*n\", \"*n\")\nlocal min = a * (n - 1) + b\nlocal max = b * (n - 1) + a\nprint(math.max(0, max - min + 1))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s612472366", "group_id": "codeNet:p03705", "input_text": "\nlocal format = string.format\nlocal find = string.find\nlocal reverse = string.reverse\nlocal sub = string.sub\nlocal upper = string.upper\nlocal lower = string.lower\nlocal rep = string.rep\nlocal char = string.char\nlocal byte = string.byte\nlocal gsub = string.gsub\n-- gsub(s,\"\\\\\",\"/\")\n-- formula = \"20% * 2\"\n-- formula = string.gsub(formula,\"%%\",\"/100\")\n-- str = \" x x 11 \"\n-- str = string.gsub(str, \"[%s%p]\", \"\")\nlocal gmatch = string.gmatch\n-- for token in string.gmatch(arr_temp, \"[^%s]+\") do\nlocal match = string.match\n\nlocal concat = table.concat\nlocal insert = table.insert\nlocal remove = table.remove\nlocal sort = table.sort\n\nlocal abs = math.abs\nlocal min = math.min\nlocal max = math.max\nlocal floor = math.floor\nlocal ceil = math.ceil\nlocal sin = math.sin\nlocal cos = math.cos\nlocal tan = math.tan\nlocal deg = math.deg\nlocal log = math.log\nlocal mod = math.mod\nlocal random = math.random\nlocal sqrt = math.sqrt\n\n\n\nlocal lua_print = print\nlocal tconcat = table.concat\nlocal tinsert = table.insert\nlocal srep = string.rep\nlocal format = string.format\nfunction print_long_str(str)\n\tlocal len = #str\n\tlocal cur = 1\n\t--每次最大输出15*1024, 超过就会蹦了\n\twhile cur <= len do\n\t\tlua_print('\\n'..string.sub(str,cur,cur + 15*1000))\n\t\tcur = cur + 15*1000 + 1\n\tend\n\tlua_print('')\nend\n\nfunction print_r(root)\n\tlocal cache = {[root] = \".\"}\n\tlocal function _dump(t,space,name)\n\t\tlocal temp = {}\n\t\tfor k,v in pairs(t) do\n\t\t\tlocal key = tostring(k)\n\t\t\tif cache[v] then\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" {\" .. cache[v]..\"}\")\n\t\t\telseif type(v) == \"table\" then\n\t\t\t\tlocal new_key = name .. \".\" .. key\n\t\t\t\tcache[v] = new_key\n\t\t\t\ttinsert(temp,\"+\" .. key .. _dump(v,space .. (next(t,k) and \"|\" or \" \" ).. srep(\" \",#key),new_key))\n\t\t\telseif type(v) == \"function\" then\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" [\".. tostring(v)..\"]\")\n\t\t\telse\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" [\".. type(v) .. \" \" .. tostring(v)..\"]\")\n\t\t\tend\n\t\tend\n\t\treturn tconcat(temp,\"\\n\"..space)\n\tend\n\tlocal str = _dump(root, \"\",\"\")\n\tprint_long_str(str)\nend\n\n\n\n-- @desc 数据长度\nlocal function length(s)\n\tlocal l = 0\n\tfor _ in pairs(s) do\n\t\tl = l + 1\n\tend\n\treturn l\nend\n\n-- @desc 数据最小值\nlocal function minn(s)\n\tlocal result\n\tfor _, v in pairs(s) do\n\t\tif not result then\n\t\t\tresult = v\n\t\telseif v < result then\n\t\t\tresult = v\n\t\tend\n\tend\n\treturn result\nend\n\n-- @desc 数据最大值\nlocal function maxn(s)\n\tlocal result\n\tfor _, v in pairs(s) do\n\t\tif not result then\n\t\t\tresult = v\n\t\telseif v > result then\n\t\t\tresult = v\n\t\tend\n\tend\n\treturn result\nend\n\n-- @desc 数据和\nlocal function sumn(s)\n\tlocal result = 0\n\tfor _, v in pairs(s) do\n\t\tresult = result + v\n\tend\n\treturn result\nend\n\n-- local str = \"fsdfas$123$fgds\"\n-- @desc split(str,'%$') --注意$是特殊字符 前面要加%！！ 结果返回{\"fsdfas\",\"123\",\"fgds\"}\nlocal function split(str, sep)\n\tlocal ret = {}\n\tlocal pos = 0\n\twhile true do\n\t\tlocal pp = string.find(str,sep,pos+1)\n\t\tif pp == nil then\n\t\t\ttable.insert(ret,string.sub(str,pos+1))\n\t\t\tbreak\n\t\telse\n\t\t\ttable.insert(ret,string.sub(str,pos+1,pp-1))\n\t\t\tpos = pp\n\t\tend\n\tend\n\treturn ret\nend\n\nlocal specialSplitStr = \"().%+-*?[]^$\"\nlocal specialSplitT = {}\nfor i = 1, #specialSplitStr do\n\tlocal c = string.sub(specialSplitStr, i, i)\n\tspecialSplitT[c] = '%' .. c\nend\n-- @desc 按非特殊字符进行分割，如模式分割直接用split\nfunction newSplit(str, symbol)\n\tsymbol = specialSplitT[symbol] or symbol\n\treturn split(str, symbol)\nend\n\n-- @desc 根据角度，返回速度方向矢量\nlocal function getDir(angle)\n\tlocal rate = angle / 180 * math.pi\n\treturn {math.cos(rate), math.sin(rate)}\nend\n\nfunction string.utf8charlen(char)\n\tif not char then\n\t\treturn 0\n\telseif char >= 240 then\n\t\treturn 4\n\telseif char >= 224 then\n\t\treturn 3\n\telseif char >= 192 then\n\t\treturn 2\n\telse\n\t\treturn 1\n\tend\nend\n\n-- 二分法获得table里小于等于value的最大下标\nfunction bisectLeft(t, value)\n    local left = 1\n    local right = #t\n    if t[right] <= value then\n        return right\n    end\n    while left < right do\n        local mid = math.floor((left + right) / 2)\n        if t[mid] > value then\n            right = mid\n        else\n            left = mid + 1\n        end\n    end\n    return math.max(1, left - 1)\nend\n-- 二分法获得table里大于等于value的最小下标\nfunction bisectRight(t, value)\n    local left = 1\n    local right = #t\n    while left < right do\n        local mid = math.floor((left + right) / 2)\n        if t[mid] >= value then\n            right = mid\n        else\n            left = mid + 1\n        end\n    end\n    return right\nend\n\n\n-- ***** VJudge acm\n-- ** input\n-- a = io.read(\"*number\")\n-- local s = io.stdin:read(\"*l\")\n-- local k = io.stdin:read(\"*n\", \"*l\")\n-- io.read()\n-- io.read(\"*n\")\n\n-- n = io.read(\"*number\", \"*l\")\n-- arr = {}\n-- arr_temp = io.read()\n-- arr_i = 1;\n-- for token in string.gmatch(arr_temp, \"[^%s]+\") do\n--    arr[arr_i] = token\n--    arr_i = arr_i + 1\n-- end\n-- *****\n\nn=io.read(\"*number\")\na=io.read(\"*number\")\nb=io.read(\"*number\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\nprint(solve())\n\n\n", "language": "Lua", "metadata": {"date": 1553554775, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s612472366.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612472366", "user_id": "u089230684"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nlocal format = string.format\nlocal find = string.find\nlocal reverse = string.reverse\nlocal sub = string.sub\nlocal upper = string.upper\nlocal lower = string.lower\nlocal rep = string.rep\nlocal char = string.char\nlocal byte = string.byte\nlocal gsub = string.gsub\n-- gsub(s,\"\\\\\",\"/\")\n-- formula = \"20% * 2\"\n-- formula = string.gsub(formula,\"%%\",\"/100\")\n-- str = \" x x 11 \"\n-- str = string.gsub(str, \"[%s%p]\", \"\")\nlocal gmatch = string.gmatch\n-- for token in string.gmatch(arr_temp, \"[^%s]+\") do\nlocal match = string.match\n\nlocal concat = table.concat\nlocal insert = table.insert\nlocal remove = table.remove\nlocal sort = table.sort\n\nlocal abs = math.abs\nlocal min = math.min\nlocal max = math.max\nlocal floor = math.floor\nlocal ceil = math.ceil\nlocal sin = math.sin\nlocal cos = math.cos\nlocal tan = math.tan\nlocal deg = math.deg\nlocal log = math.log\nlocal mod = math.mod\nlocal random = math.random\nlocal sqrt = math.sqrt\n\n\n\nlocal lua_print = print\nlocal tconcat = table.concat\nlocal tinsert = table.insert\nlocal srep = string.rep\nlocal format = string.format\nfunction print_long_str(str)\n\tlocal len = #str\n\tlocal cur = 1\n\t--每次最大输出15*1024, 超过就会蹦了\n\twhile cur <= len do\n\t\tlua_print('\\n'..string.sub(str,cur,cur + 15*1000))\n\t\tcur = cur + 15*1000 + 1\n\tend\n\tlua_print('')\nend\n\nfunction print_r(root)\n\tlocal cache = {[root] = \".\"}\n\tlocal function _dump(t,space,name)\n\t\tlocal temp = {}\n\t\tfor k,v in pairs(t) do\n\t\t\tlocal key = tostring(k)\n\t\t\tif cache[v] then\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" {\" .. cache[v]..\"}\")\n\t\t\telseif type(v) == \"table\" then\n\t\t\t\tlocal new_key = name .. \".\" .. key\n\t\t\t\tcache[v] = new_key\n\t\t\t\ttinsert(temp,\"+\" .. key .. _dump(v,space .. (next(t,k) and \"|\" or \" \" ).. srep(\" \",#key),new_key))\n\t\t\telseif type(v) == \"function\" then\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" [\".. tostring(v)..\"]\")\n\t\t\telse\n\t\t\t\ttinsert(temp,\"+\" .. key .. \" [\".. type(v) .. \" \" .. tostring(v)..\"]\")\n\t\t\tend\n\t\tend\n\t\treturn tconcat(temp,\"\\n\"..space)\n\tend\n\tlocal str = _dump(root, \"\",\"\")\n\tprint_long_str(str)\nend\n\n\n\n-- @desc 数据长度\nlocal function length(s)\n\tlocal l = 0\n\tfor _ in pairs(s) do\n\t\tl = l + 1\n\tend\n\treturn l\nend\n\n-- @desc 数据最小值\nlocal function minn(s)\n\tlocal result\n\tfor _, v in pairs(s) do\n\t\tif not result then\n\t\t\tresult = v\n\t\telseif v < result then\n\t\t\tresult = v\n\t\tend\n\tend\n\treturn result\nend\n\n-- @desc 数据最大值\nlocal function maxn(s)\n\tlocal result\n\tfor _, v in pairs(s) do\n\t\tif not result then\n\t\t\tresult = v\n\t\telseif v > result then\n\t\t\tresult = v\n\t\tend\n\tend\n\treturn result\nend\n\n-- @desc 数据和\nlocal function sumn(s)\n\tlocal result = 0\n\tfor _, v in pairs(s) do\n\t\tresult = result + v\n\tend\n\treturn result\nend\n\n-- local str = \"fsdfas$123$fgds\"\n-- @desc split(str,'%$') --注意$是特殊字符 前面要加%！！ 结果返回{\"fsdfas\",\"123\",\"fgds\"}\nlocal function split(str, sep)\n\tlocal ret = {}\n\tlocal pos = 0\n\twhile true do\n\t\tlocal pp = string.find(str,sep,pos+1)\n\t\tif pp == nil then\n\t\t\ttable.insert(ret,string.sub(str,pos+1))\n\t\t\tbreak\n\t\telse\n\t\t\ttable.insert(ret,string.sub(str,pos+1,pp-1))\n\t\t\tpos = pp\n\t\tend\n\tend\n\treturn ret\nend\n\nlocal specialSplitStr = \"().%+-*?[]^$\"\nlocal specialSplitT = {}\nfor i = 1, #specialSplitStr do\n\tlocal c = string.sub(specialSplitStr, i, i)\n\tspecialSplitT[c] = '%' .. c\nend\n-- @desc 按非特殊字符进行分割，如模式分割直接用split\nfunction newSplit(str, symbol)\n\tsymbol = specialSplitT[symbol] or symbol\n\treturn split(str, symbol)\nend\n\n-- @desc 根据角度，返回速度方向矢量\nlocal function getDir(angle)\n\tlocal rate = angle / 180 * math.pi\n\treturn {math.cos(rate), math.sin(rate)}\nend\n\nfunction string.utf8charlen(char)\n\tif not char then\n\t\treturn 0\n\telseif char >= 240 then\n\t\treturn 4\n\telseif char >= 224 then\n\t\treturn 3\n\telseif char >= 192 then\n\t\treturn 2\n\telse\n\t\treturn 1\n\tend\nend\n\n-- 二分法获得table里小于等于value的最大下标\nfunction bisectLeft(t, value)\n    local left = 1\n    local right = #t\n    if t[right] <= value then\n        return right\n    end\n    while left < right do\n        local mid = math.floor((left + right) / 2)\n        if t[mid] > value then\n            right = mid\n        else\n            left = mid + 1\n        end\n    end\n    return math.max(1, left - 1)\nend\n-- 二分法获得table里大于等于value的最小下标\nfunction bisectRight(t, value)\n    local left = 1\n    local right = #t\n    while left < right do\n        local mid = math.floor((left + right) / 2)\n        if t[mid] >= value then\n            right = mid\n        else\n            left = mid + 1\n        end\n    end\n    return right\nend\n\n\n-- ***** VJudge acm\n-- ** input\n-- a = io.read(\"*number\")\n-- local s = io.stdin:read(\"*l\")\n-- local k = io.stdin:read(\"*n\", \"*l\")\n-- io.read()\n-- io.read(\"*n\")\n\n-- n = io.read(\"*number\", \"*l\")\n-- arr = {}\n-- arr_temp = io.read()\n-- arr_i = 1;\n-- for token in string.gmatch(arr_temp, \"[^%s]+\") do\n--    arr[arr_i] = token\n--    arr_i = arr_i + 1\n-- end\n-- *****\n\nn=io.read(\"*number\")\na=io.read(\"*number\")\nb=io.read(\"*number\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\nprint(solve())\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5153, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s813649956", "group_id": "codeNet:p03705", "input_text": "n=io.read(\"*number\")\na=io.read(\"*number\")\nb=io.read(\"*number\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "language": "Lua", "metadata": {"date": 1553554264, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s813649956.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s813649956", "user_id": "u018679195"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "n=io.read(\"*number\")\na=io.read(\"*number\")\nb=io.read(\"*number\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s502311264", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal function add(n,a,b)\n\tif b < a then\n\t\tprint(0)\n\t\treturn\n\tend\n\tif n == 1 then\n\t\tif a ~= b then\n\t\t\tprint(0)\n\t\t\treturn\n\t\telse\n\t\t\tprint(1)\n\t\t\treturn\n\t\tend\n\telseif n == 2 then\n\t\t\tprint(1)\n\t\t\treturn\n\tend\n\tlocal total = a + b\n\tlocal min = total + (n - 2) * a\n\tlocal max = total + (n-2)*b\n\tprint( max - min + 1)\nend\n\nadd(n,a,b)", "language": "Lua", "metadata": {"date": 1553130601, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s502311264.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s502311264", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal function add(n,a,b)\n\tif b < a then\n\t\tprint(0)\n\t\treturn\n\tend\n\tif n == 1 then\n\t\tif a ~= b then\n\t\t\tprint(0)\n\t\t\treturn\n\t\telse\n\t\t\tprint(1)\n\t\t\treturn\n\t\tend\n\telseif n == 2 then\n\t\t\tprint(1)\n\t\t\treturn\n\tend\n\tlocal total = a + b\n\tlocal min = total + (n - 2) * a\n\tlocal max = total + (n-2)*b\n\tprint( max - min + 1)\nend\n\nadd(n,a,b)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s253531747", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal function add(n,a,b)\n\tlocal total = a + b\n\tlocal min = total + (n - 2) * a\n\tlocal max = total + (n-2)*b\n\treturn max - min + 1\nend\n\nprint(add(n,a,b))", "language": "Lua", "metadata": {"date": 1553130368, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s253531747.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s253531747", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\nlocal function add(n,a,b)\n\tlocal total = a + b\n\tlocal min = total + (n - 2) * a\n\tlocal max = total + (n-2)*b\n\treturn max - min + 1\nend\n\nprint(add(n,a,b))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s299030218", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*number\")\nlocal l = io.read(\"*number\")\nlocal b = io.read(\"*number\")\n\nlocal sum = 0\nif l ~= b and n < 2 then\n\tprint(sum)\n \treturn sum\nend\n\nif l > b then\n\tprint(sum)\n\treturn sum\nend\n\nlocal minx = (n - 1)*l + b\nlocal maxx = (n-1)*b + l\n\nlocal sum = maxx - minx + 1\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1553130014, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s299030218.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s299030218", "user_id": "u018679195"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal l = io.read(\"*number\")\nlocal b = io.read(\"*number\")\n\nlocal sum = 0\nif l ~= b and n < 2 then\n\tprint(sum)\n \treturn sum\nend\n\nif l > b then\n\tprint(sum)\n\treturn sum\nend\n\nlocal minx = (n - 1)*l + b\nlocal maxx = (n-1)*b + l\n\nlocal sum = maxx - minx + 1\nprint(sum)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s409767953", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*number\")\nlocal l = io.read(\"*number\")\nlocal b = io.read(\"*number\")\n\n\nif l ~= b and n < 2 then\n \treturn 0\nend\n\nif l > b then\n\treturn 0\nend\n\nlocal minx = (n - 1)*l + b\nlocal maxx = (n-1)*b + l\n\nlocal sum = maxx - minx + 1\nprint(sum)\n", "language": "Lua", "metadata": {"date": 1553129871, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s409767953.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409767953", "user_id": "u353919145"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*number\")\nlocal l = io.read(\"*number\")\nlocal b = io.read(\"*number\")\n\n\nif l ~= b and n < 2 then\n \treturn 0\nend\n\nif l > b then\n\treturn 0\nend\n\nlocal minx = (n - 1)*l + b\nlocal maxx = (n-1)*b + l\n\nlocal sum = maxx - minx + 1\nprint(sum)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s505634223", "group_id": "codeNet:p03705", "input_text": " local n = io.read(\"*n\")\n local a = io.read(\"*n\")\n local b = io.read(\"*n\")\n\n if a > b then\n \tprint(0)\n end\n\nprint((n * b + (a-b)) - (n*a + (b - a)) + 1)", "language": "Lua", "metadata": {"date": 1553129529, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s505634223.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s505634223", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": " local n = io.read(\"*n\")\n local a = io.read(\"*n\")\n local b = io.read(\"*n\")\n\n if a > b then\n \tprint(0)\n end\n\nprint((n * b + (a-b)) - (n*a + (b - a)) + 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s290110756", "group_id": "codeNet:p03705", "input_text": "\nn=io.read(\"*n\")\na=io.read(\"*n\")\nb=io.read(\"*n\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "language": "Lua", "metadata": {"date": 1553129040, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s290110756.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290110756", "user_id": "u089230684"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nn=io.read(\"*n\")\na=io.read(\"*n\")\nb=io.read(\"*n\")\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s098128484", "group_id": "codeNet:p03705", "input_text": "\nn=io.read()\na=io.read()\nb=io.read()\nn = tonumber(n)\na = tonumber(a)\nb = tonumber(b)\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "language": "Lua", "metadata": {"date": 1553128945, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s098128484.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s098128484", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nn=io.read()\na=io.read()\nb=io.read()\nn = tonumber(n)\na = tonumber(a)\nb = tonumber(b)\nfunction solve()\n\tif a > b then\n\t\treturn 0\n\tend\n\tif n == 1 then\n\t\tif a == b then\n\t\t\treturn 1\n\t\telse\n\t\t\treturn 0\n\t\tend\n\tend\n\treturn a + (n - 1) * b - ( b + (n - 1) * a ) + 1\nend\n\nprint(solve())", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 277, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s987439587", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a > b then\n\treturn 0\nend\n\nreturn (n * b + (a-b)) - (n*a + (b - a)) + 1", "language": "Lua", "metadata": {"date": 1553128286, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s987439587.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s987439587", "user_id": "u018679195"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a > b then\n\treturn 0\nend\n\nreturn (n * b + (a-b)) - (n*a + (b - a)) + 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s492824291", "group_id": "codeNet:p03705", "input_text": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a > b then\n\treturn 0\n\nend\n\nlocal total = a + b\nlocal min = total + (n - 2) * a\nlocal max = total + (n - 2)*b\n\nreturn max - min + 1", "language": "Lua", "metadata": {"date": 1553127944, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s492824291.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s492824291", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read(\"*n\")\nlocal a = io.read(\"*n\")\nlocal b = io.read(\"*n\")\n\nif a > b then\n\treturn 0\n\nend\n\nlocal total = a + b\nlocal min = total + (n - 2) * a\nlocal max = total + (n - 2)*b\n\nreturn max - min + 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s106131040", "group_id": "codeNet:p03705", "input_text": "local n = io.read('*n')\nlocal a = io.read('*n')\nlocal b = io.read('*n')\nif b < a then\n\tprint(0)\n\treturn\nend\nif n == 1 then\n\tif a ~= b then\n\t\tprint(0)\n\t\treturn\n\telse\n\t\tprint(1)\n\t\treturn\n\tend\nelseif n == 2 then\n\tprint(1)\n\treturn\nend\nprint((n-2)*(b-a)+1)", "language": "Lua", "metadata": {"date": 1553127145, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s106131040.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106131040", "user_id": "u089230684"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read('*n')\nlocal a = io.read('*n')\nlocal b = io.read('*n')\nif b < a then\n\tprint(0)\n\treturn\nend\nif n == 1 then\n\tif a ~= b then\n\t\tprint(0)\n\t\treturn\n\telse\n\t\tprint(1)\n\t\treturn\n\tend\nelseif n == 2 then\n\tprint(1)\n\treturn\nend\nprint((n-2)*(b-a)+1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s503312819", "group_id": "codeNet:p03705", "input_text": "local n = io.read('*n')\nlocal a = io.read('*n')\nlocal b = io.read('*n')\nif b < a then\n\tprint(0)\n\treturn\nend\nif n == 1 then\n\tif a ~= b then\n\t\tprint(0)\n\t\treturn\n\telse\n\t\tprint(1)\n\t\treturn\n\tend\nelseif n == 2 then\n\tprint(1)\n\treturn\nend\nprint((n-2)*(b-a))", "language": "Lua", "metadata": {"date": 1553126971, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lua/s503312819.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s503312819", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local n = io.read('*n')\nlocal a = io.read('*n')\nlocal b = io.read('*n')\nif b < a then\n\tprint(0)\n\treturn\nend\nif n == 1 then\n\tif a ~= b then\n\t\tprint(0)\n\t\treturn\n\telse\n\t\tprint(1)\n\t\treturn\n\tend\nelseif n == 2 then\n\tprint(1)\n\treturn\nend\nprint((n-2)*(b-a))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B 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 the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 884}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s178581032", "group_id": "codeNet:p03714", "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, 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 = 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 inf = 1000000007\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor v in s:gmatch(\"%d+\") do\n  table.insert(t, tonumber(v))\nend\nlocal used = {}\nfor i = 1, n do\n  used[i] = false\nend\nfor i = n + 1, 3 * n do\n  used[i] = true\nend\nused[n * 3 + 1] = true\nt[n * 3 + 1] = inf\nlocal function merge(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[a] < t[b] then return a\n  else return b\n  end\nend\nlocal st = SegTree.new(n * 2, merge, n * 3 + 1)\nlocal cursum = 0\nfor i = 1, n do\n  cursum = cursum + t[i]\nend\nlocal left = {cursum}\nfor i = 1, n do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p)\n  left[1 + i] = cursum\nend\n-- right\ncursum = 0\n\nfor i = 1, 2 * n do\n  t[i] = -t[i + n]\nend\nfor i = 1, n do\n  used[i] = true\nend\nfor i = n + 1, 2 * n do\n  cursum = cursum + t[i]\n  used[i] = false\nend\nlocal right = {cursum}\n\nst:updateAll()\n\nfor i = n, 1, -1 do\n  used[i] = false\n  st:update(i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[i] - t[p]\n  used[p] = true\n  st:update(p)\n  right[n + 2 - i] = cursum\nend\n\nlocal ret = left[1] + right[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, left[i] + right[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1591330263, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s178581032.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178581032", "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 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, 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 = 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 inf = 1000000007\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor v in s:gmatch(\"%d+\") do\n  table.insert(t, tonumber(v))\nend\nlocal used = {}\nfor i = 1, n do\n  used[i] = false\nend\nfor i = n + 1, 3 * n do\n  used[i] = true\nend\nused[n * 3 + 1] = true\nt[n * 3 + 1] = inf\nlocal function merge(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[a] < t[b] then return a\n  else return b\n  end\nend\nlocal st = SegTree.new(n * 2, merge, n * 3 + 1)\nlocal cursum = 0\nfor i = 1, n do\n  cursum = cursum + t[i]\nend\nlocal left = {cursum}\nfor i = 1, n do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p)\n  left[1 + i] = cursum\nend\n-- right\ncursum = 0\n\nfor i = 1, 2 * n do\n  t[i] = -t[i + n]\nend\nfor i = 1, n do\n  used[i] = true\nend\nfor i = n + 1, 2 * n do\n  cursum = cursum + t[i]\n  used[i] = false\nend\nlocal right = {cursum}\n\nst:updateAll()\n\nfor i = n, 1, -1 do\n  used[i] = false\n  st:update(i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[i] - t[p]\n  used[p] = true\n  st:update(p)\n  right[n + 2 - i] = cursum\nend\n\nlocal ret = left[1] + right[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, left[i] + right[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3371, "cpu_time_ms": 414, "memory_kb": 32620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s371266139", "group_id": "codeNet:p03714", "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, 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 = 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 inf = 1000000007\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor v in s:gmatch(\"%d+\") do\n  table.insert(t, tonumber(v))\nend\nlocal used = {}\nfor i = 1, n do\n  used[i] = false\nend\nfor i = n + 1, 3 * n do\n  used[i] = true\nend\nused[n * 3 + 1] = true\nt[n * 3 + 1] = inf\nlocal function merge(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[a] < t[b] then return a\n  else return b\n  end\nend\nlocal st = SegTree.new(n * 2, merge, n * 3 + 1)\nlocal cursum = 0\nfor i = 1, n do\n  cursum = cursum + t[i]\nend\nlocal left = {cursum}\nfor i = 1, n do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p)\n  left[1 + i] = cursum\nend\n-- right\nfor i = 1, 2 * n do\n  used[i] = true\nend\ncursum = 0\nfor i = 2 * n + 1, 3 * n do\n  cursum = cursum + t[i]\n  used[i] = false\nend\nlocal right = {cursum}\n\nlocal function merge2(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[b] < t[a] then return a\n  else return b\n  end\nend\nst.func = merge2\n\nfor i = 1, 2 * n do\n  st:setValue(i, i + n, true)\nend\nst:updateAll()\n\nfor i = n, 1, -1 do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p - n)\n  right[n + 2 - i] = cursum\nend\n\nlocal ret = left[1] - right[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, left[i] - right[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1591330031, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s371266139.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371266139", "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 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, 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 = 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 inf = 1000000007\nlocal n = io.read(\"*n\", \"*l\")\nlocal s = io.read()\nlocal t = {}\nfor v in s:gmatch(\"%d+\") do\n  table.insert(t, tonumber(v))\nend\nlocal used = {}\nfor i = 1, n do\n  used[i] = false\nend\nfor i = n + 1, 3 * n do\n  used[i] = true\nend\nused[n * 3 + 1] = true\nt[n * 3 + 1] = inf\nlocal function merge(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[a] < t[b] then return a\n  else return b\n  end\nend\nlocal st = SegTree.new(n * 2, merge, n * 3 + 1)\nlocal cursum = 0\nfor i = 1, n do\n  cursum = cursum + t[i]\nend\nlocal left = {cursum}\nfor i = 1, n do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p)\n  left[1 + i] = cursum\nend\n-- right\nfor i = 1, 2 * n do\n  used[i] = true\nend\ncursum = 0\nfor i = 2 * n + 1, 3 * n do\n  cursum = cursum + t[i]\n  used[i] = false\nend\nlocal right = {cursum}\n\nlocal function merge2(a, b)\n  if used[a] then return b\n  elseif used[b] then return a\n  elseif t[b] < t[a] then return a\n  else return b\n  end\nend\nst.func = merge2\n\nfor i = 1, 2 * n do\n  st:setValue(i, i + n, true)\nend\nst:updateAll()\n\nfor i = n, 1, -1 do\n  used[n + i] = false\n  st:update(n + i)\n  local p = st.stage[1][1]\n  cursum = cursum + t[n + i] - t[p]\n  used[p] = true\n  st:update(p - n)\n  right[n + 2 - i] = cursum\nend\n\nlocal ret = left[1] - right[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, left[i] - right[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3570, "cpu_time_ms": 497, "memory_kb": 32624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s511474089", "group_id": "codeNet:p03714", "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.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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:push(a[i])\nend\nfor i = 1, n do\n  avleft:push(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:push(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:push(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1584804187, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s511474089.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511474089", "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\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.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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:push(a[i])\nend\nfor i = 1, n do\n  avleft:push(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:push(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:push(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6207, "cpu_time_ms": 777, "memory_kb": 35372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s062116675", "group_id": "codeNet:p03714", "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  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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:recalcCount(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(child, parent)\n      else\n        local cr = self.r[child]\n        self:rotL(cr, child)\n        self:rotR(cr, parent)\n      end\n      pos = 1\n    elseif lcp_m_rcp == -2 then\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 = 1\n    else\n      -- self:recalcCountAll(child)\n      pos = 1\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1570301281, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s062116675.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062116675", "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\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local i = self.box[#self.box]\n  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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:recalcCount(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(child, parent)\n      else\n        local cr = self.r[child]\n        self:rotL(cr, child)\n        self:rotR(cr, parent)\n      end\n      pos = 1\n    elseif lcp_m_rcp == -2 then\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 = 1\n    else\n      -- self:recalcCountAll(child)\n      pos = 1\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5315, "cpu_time_ms": 903, "memory_kb": 35368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s379797687", "group_id": "codeNet:p03714", "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  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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: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        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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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        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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1570296808, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s379797687.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379797687", "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\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local i = self.box[#self.box]\n  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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: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        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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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        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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5588, "cpu_time_ms": 1026, "memory_kb": 37204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s599016211", "group_id": "codeNet:p03714", "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  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1570294028, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s599016211.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599016211", "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\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local i = self.box[#self.box]\n  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\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\n  end\nend\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = 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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5652, "cpu_time_ms": 1014, "memory_kb": 35352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s021763523", "group_id": "codeNet:p03714", "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  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568741498, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s021763523.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021763523", "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\n\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local i = self.box[#self.box]\n  table.remove(self.box)\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.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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\nAvlTree.recalcCountAll = function(self, i)\n  while 1 < i do\n    self:recalcCount(i)\n    i = self.p[i]\n  end\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.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  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\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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\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  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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 = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5740, "cpu_time_ms": 1073, "memory_kb": 36276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s636979549", "group_id": "codeNet:p03714", "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]\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  self.stage[stagenum][1] = false\n  for i = 2, 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.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\nSegAvlTree.create = function(self, lessthan, n)\n  self.lessthan = lessthan\n  self.root = 1\n  self.seg = SegForAvl.new(n + 1)\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\nSegAvlTree.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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 1 < 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  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\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  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\n  self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nSegAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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 1 < self.l[node] do\n    node = self.l[node]\n  end\n  local v = self.v[node]\n  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568139322, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s636979549.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636979549", "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]\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  self.stage[stagenum][1] = false\n  for i = 2, 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.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\nSegAvlTree.create = function(self, lessthan, n)\n  self.lessthan = lessthan\n  self.root = 1\n  self.seg = SegForAvl.new(n + 1)\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\nSegAvlTree.recalcCount = function(self, i)\n  if 1 < i then\n    if 1 < 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 1 < 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 1 < 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  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\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  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\n  self:recalcCountAll(parent)\nend\n\nSegAvlTree.add = function(self, val)\n  if self.root <= 1 then self.root = self:makenode(val, 1) 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 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        added = true\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        added = true\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: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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\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 = 1\n      else\n        self:recalcCountAll(child)\n        pos = 1\n      end\n    end\n  end\nend\n\nSegAvlTree.rmsub = function(self, node)\n  while 1 < 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 = 1\n    else\n      if self.lc[self.r[node]] == self.rc[self.r[node]] then\n        self:rotL(self.r[node], node)\n        node = 1\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 1 < self.l[node] do\n    node = self.l[node]\n  end\n  local v = self.v[node]\n  if 1 < self.p[node] then\n    self.p[self.r[node]] = self.p[node]\n    self.l[self.p[node]] = self.r[node]\n    self:rmsub(self.p[node])\n  else\n    self.p[self.r[node]] = 1\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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7083, "cpu_time_ms": 1110, "memory_kb": 37400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s899321717", "group_id": "codeNet:p03714", "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        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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568127681, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s899321717.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899321717", "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        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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7284, "cpu_time_ms": 1254, "memory_kb": 39676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s365685213", "group_id": "codeNet:p03714", "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.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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1568039347, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s365685213.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s365685213", "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.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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7380, "cpu_time_ms": 1252, "memory_kb": 39552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s023018059", "group_id": "codeNet:p03714", "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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567991265, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s023018059.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s023018059", "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\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = SegAvlTree.new(function(x, y) return x < y end, n + 1)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = SegAvlTree.new(function(x, y) return x > y end, n + 1)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7565, "cpu_time_ms": 1363, "memory_kb": 39620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s782118449", "group_id": "codeNet:p03714", "input_text": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  while pos do\n    local child, parent = pos, pos.p\n    if not parent then\n      break\n    end\n    self:recalcCount(parent)\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        pos = parent\n      elseif parent.lc - 2 == parent.rc then\n        self:recalcCount(child)\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\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 parent.rc - 1 == parent.lc then\n        pos = parent\n      elseif parent.rc - 2 == parent.lc then\n        self:recalcCount(child)\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\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\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567977877, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s782118449.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782118449", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  while pos do\n    local child, parent = pos, pos.p\n    if not parent then\n      break\n    end\n    self:recalcCount(parent)\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        pos = parent\n      elseif parent.lc - 2 == parent.rc then\n        self:recalcCount(child)\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\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 parent.rc - 1 == parent.lc then\n        pos = parent\n      elseif parent.rc - 2 == parent.lc then\n        self:recalcCount(child)\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\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\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4903, "cpu_time_ms": 1635, "memory_kb": 106944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s895794864", "group_id": "codeNet:p03714", "input_text": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  while pos do\n    local child, parent = pos, pos.p\n    if not parent then\n      break\n    end\n    self:recalcCount(child)\n    self:recalcCount(parent)\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        pos = parent\n      elseif parent.lc - 2 == parent.rc then\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\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 parent.rc - 1 == parent.lc then\n        pos = parent\n      elseif parent.rc - 2 == parent.lc then\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\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\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567976983, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s895794864.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s895794864", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  while pos do\n    local child, parent = pos, pos.p\n    if not parent then\n      break\n    end\n    self:recalcCount(child)\n    self:recalcCount(parent)\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        pos = parent\n      elseif parent.lc - 2 == parent.rc then\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\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 parent.rc - 1 == parent.lc then\n        pos = parent\n      elseif parent.rc - 2 == parent.lc then\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\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\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4867, "cpu_time_ms": 1702, "memory_kb": 107164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s260606946", "group_id": "codeNet:p03714", "input_text": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  self:recalcCountAll(pos)\n  local resolve_child = pos\n  while resolve_child do\n    local child, parent = resolve_child, resolve_child.p\n    resolve_child = nil\n    if not parent then\n      break\n    end\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        resolve_child = parent\n      elseif parent.lc - 2 == parent.rc then\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\n          self:rotL(cr, child)\n          self:rotR(cr, parent)\n        end\n      end\n    else -- parent.r == child\n      if parent.rc - 1 == parent.lc then\n        resolve_child = parent\n      elseif parent.rc - 2 == parent.lc then\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\n          self:rotR(cl, child)\n          self:rotL(cl, parent)\n        end\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1567970425, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s260606946.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s260606946", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mma = math.max\nlocal AvlTree = {}\nAvlTree.makenode = function(self, val, parent)\n  local node = {}\n  node.v, node.lc, node.rc = val, 0, 0\n  node.p = parent\n  -- node.l, node.r = nil, nil\n  return node\nend\nAvlTree.create = function(self, lessthan)\n  self.lessthan = lessthan\nend\n\nAvlTree.recalcCount = function(self, node)\n  if node then\n    if node.l then node.lc = 1 + mma(node.l.lc, node.l.rc)\n    else node.lc = 0\n    end\n    if node.r then node.rc = 1 + mma(node.r.lc, node.r.rc)\n    else node.rc = 0\n    end\n  end\nend\nAvlTree.recalcCountAll = function(self, node)\n  while node do\n    self:recalcCount(node)\n    node = node.p\n  end\nend\n\nAvlTree.rotR = function(self, child, parent)\n  local granp = parent.p\n  child.r, parent.l = parent, child.r\n  child.p, parent.p = granp, child\n  if parent.l then parent.l.p = parent end\n  if granp then\n    if granp.l == parent then\n      granp.l = child\n    else\n      granp.r = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.rotL = function(self, child, parent)\n  local granp = parent.p\n  child.l, parent.r = parent, child.l\n  child.p, parent.p = granp, child\n  if parent.r then parent.r.p = parent end\n  if granp then\n    if granp.r == parent then\n      granp.r = child\n    else\n      granp.l = child\n    end\n  else -- granp == nil\n    self.root = child\n  end\n  self:recalcCountAll(parent)\nend\n\nAvlTree.add = function(self, val)\n  if not self.root then self.root = self:makenode(val) return end\n  local pos = self.root\n  local added = false\n  while not added do\n    if self.lessthan(val, pos.v) then\n      if pos.l then\n        pos = pos.l\n      else\n        pos.l = self:makenode(val, pos)\n        pos = pos.l\n        added = true\n      end\n    else\n      if pos.r then\n        pos = pos.r\n      else\n        pos.r = self:makenode(val, pos)\n        pos = pos.r\n        added = true\n      end\n    end\n  end\n  self:recalcCountAll(pos)\n  local resolve_child = pos\n  while resolve_child do\n    local child, parent = resolve_child, resolve_child.p\n    resolve_child = nil\n    if not parent then\n      break\n    end\n    if parent.l == child then\n      if parent.lc - 1 == parent.rc then\n        resolve_child = parent\n      elseif parent.lc - 2 == parent.rc then\n        if child.lc - 1 == child.rc then\n          self:rotR(child, parent)\n        else\n          local cr = child.r\n          self:rotL(cr, child)\n          self:rotR(cr, parent)\n        end\n      end\n    else -- parent.r == child\n      if parent.rc - 1 == parent.lc then\n        resolve_child = parent\n      elseif parent.rc - 2 == parent.lc then\n        if child.rc - 1 == child.lc then\n          self:rotL(child, parent)\n        else\n          local cl = child.l\n          self:rotR(cl, child)\n          self:rotL(cl, parent)\n        end\n      end\n    end\n  end\nend\n\nAvlTree.rmsub = function(self, node)\n  while node do\n    self:recalcCount(node)\n    if node.lc == node.rc then\n      node = node.p\n    elseif node.lc + 1 == node.rc then\n      self:recalcCountAll(node.p)\n      node = nil\n    else\n      if node.r.lc == node.r.rc then\n        self:rotL(node.r, node)\n        self:recalcCountAll(node)\n        node = nil\n      elseif node.r.lc + 1 == node.r.rc then\n        local nr = node.r\n        self:rotL(nr, node)\n        node = nr\n      else\n        local nrl = node.r.l\n        self:rotR(nrl, node.r)\n        self:rotL(nrl, node)\n        node = nrl\n      end\n    end\n  end\nend\n\nAvlTree.pop = function(self)\n  local edge = self.root\n  while edge.l do\n    edge = edge.l\n  end\n  local v = edge.v\n  if edge.p then\n    if edge.r then edge.r.p = edge.p end\n    edge.p.l = edge.r\n    self:rmsub(edge.p)\n  else\n    if edge.r then edge.r.p = nil end\n    self.root = edge.r\n  end\n  return v\nend\n\nAvlTree.new = function(lessthan)\n    local obj = {}\n    setmetatable(obj, {__index = AvlTree})\n    obj:create(lessthan)\n    return obj\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal s = io.read()\nfor str in s:gmatch(\"%d+\") do\n  table.insert(a, tonumber(str))\nend\nlocal leftsum = {0}\nlocal avleft = AvlTree.new(function(x, y) return x < y end)\nfor i = 1, n do\n  leftsum[1] = leftsum[1] + a[i]\n  avleft:add(a[i])\nend\nfor i = 1, n do\n  avleft:add(a[i + n])\n  leftsum[i + 1] = leftsum[i] + a[i + n] - avleft:pop()\nend\nlocal avright = AvlTree.new(function(x, y) return x > y end)\nlocal rightsum = {0}\nfor i = 1, n do\n  rightsum[1] = rightsum[1] + a[i + 2 * n]\n  avright:add(a[i + 2 * n])\nend\nfor i = 1, n do\n  avright:add(a[2 * n + 1 - i])\n  rightsum[i + 1] = rightsum[i] + a[2 * n + 1 - i] - avright:pop()\nend\nlocal ret = leftsum[1] - rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] - rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4705, "cpu_time_ms": 1606, "memory_kb": 107172}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s310987062", "group_id": "codeNet:p03714", "input_text": "local mfl, mce, mmi, mma = math.floor, math.ceil, math.min, 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, 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.addValue = function(self, idx, val)\n  self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + val\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.new = function(ary, func, emptyvalue)\n  local obj = {}\n  setmetatable(obj, {__index = SegTree})\n  obj:create(ary, func, emptyvalue)\n  return obj\nend\n\nSegTree.takeLeft = function(self)\n  local ret, retpos = self.emptyvalue, 0\n  local t1, t2, t3 = {1}, {1}, {self.size[1]}\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 sz <= r + 1 - l then\n      local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n      if tmp < 1 then\n        ret, retpos = tmp, l + sz - 1\n        if sz ~= 1 then table.insert(t1, stage + 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    else\n      table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n    end\n  end\n  retpos = retpos + 1\n  self:addValue(retpos, -1)\n  return retpos\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal str = io.read()\nfor v in str:gmatch(\"%d+\") do\n  table.insert(a, tonumber(v))\nend\nlocal value_list, value_to_idx = {}, {}\nfor i = 1, n * 2 do\n  if not value_to_idx[a[i]] then\n    value_to_idx[a[i]] = true\n    table.insert(value_list, a[i])\n  end\nend\ntable.sort(value_list)\nvalue_to_idx = {}\nfor i = 1, #value_list do value_to_idx[value_list[i]] = i end\nlocal st = nil\nlocal leftsum = 0\ndo\n  local stary = {}\n  for i = 1, #value_list do stary[i] = 0 end\n  for i = 1, n do\n    stary[value_to_idx[a[i]]] = stary[value_to_idx[a[i]]] + 1\n    leftsum = leftsum + a[i]\n  end\n  st = SegTree.new(stary, function(a,b)return a+b end, 0)\nend\nleftsum = {leftsum}\nfor i = 1, n do\n  st:addValue(value_to_idx[a[n + i]], 1)\n  local pos = st:takeLeft()\n  leftsum[i + 1] = leftsum[i] + a[n + i] - value_list[pos]\nend\n-- r\nvalue_list, value_to_idx = {}, {}\nfor i = n + 1, n * 3 do\n  if not value_to_idx[-a[i]] then\n    value_to_idx[-a[i]] = true\n    table.insert(value_list, -a[i])\n  end\nend\ntable.sort(value_list)\nvalue_to_idx = {}\nfor i = 1, #value_list do value_to_idx[value_list[i]] = i end\nlocal st = nil\nlocal rightsum = 0\ndo\n  local stary = {}\n  for i = 1, #value_list do stary[i] = 0 end\n  for i = 2 * n + 1, n * 3 do\n    stary[value_to_idx[-a[i]]] = stary[value_to_idx[-a[i]]] + 1\n    rightsum = rightsum - a[i]\n  end\n  st = SegTree.new(stary, function(a,b)return a+b end, 0)\nend\nrightsum = {rightsum}\nfor i = n, 1, -1 do\n  st:addValue(value_to_idx[-a[n + i]], 1)\n  local pos = st:takeLeft()\n  rightsum[n + 2 - i] = rightsum[n + 1 - i] - a[n + i] - value_list[pos]\nend\nlocal ret = leftsum[1] + rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] + rightsum[n + 2 - i])\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1564807403, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lua/s310987062.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s310987062", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local mfl, mce, mmi, mma = math.floor, math.ceil, math.min, 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, 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.addValue = function(self, idx, val)\n  self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + val\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.new = function(ary, func, emptyvalue)\n  local obj = {}\n  setmetatable(obj, {__index = SegTree})\n  obj:create(ary, func, emptyvalue)\n  return obj\nend\n\nSegTree.takeLeft = function(self)\n  local ret, retpos = self.emptyvalue, 0\n  local t1, t2, t3 = {1}, {1}, {self.size[1]}\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 sz <= r + 1 - l then\n      local tmp = self.func(ret, self.stage[stage][mce(l / sz)])\n      if tmp < 1 then\n        ret, retpos = tmp, l + sz - 1\n        if sz ~= 1 then table.insert(t1, stage + 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    else\n      table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)\n    end\n  end\n  retpos = retpos + 1\n  self:addValue(retpos, -1)\n  return retpos\nend\n\nlocal n = io.read(\"*n\", \"*l\")\nlocal a = {}\nlocal str = io.read()\nfor v in str:gmatch(\"%d+\") do\n  table.insert(a, tonumber(v))\nend\nlocal value_list, value_to_idx = {}, {}\nfor i = 1, n * 2 do\n  if not value_to_idx[a[i]] then\n    value_to_idx[a[i]] = true\n    table.insert(value_list, a[i])\n  end\nend\ntable.sort(value_list)\nvalue_to_idx = {}\nfor i = 1, #value_list do value_to_idx[value_list[i]] = i end\nlocal st = nil\nlocal leftsum = 0\ndo\n  local stary = {}\n  for i = 1, #value_list do stary[i] = 0 end\n  for i = 1, n do\n    stary[value_to_idx[a[i]]] = stary[value_to_idx[a[i]]] + 1\n    leftsum = leftsum + a[i]\n  end\n  st = SegTree.new(stary, function(a,b)return a+b end, 0)\nend\nleftsum = {leftsum}\nfor i = 1, n do\n  st:addValue(value_to_idx[a[n + i]], 1)\n  local pos = st:takeLeft()\n  leftsum[i + 1] = leftsum[i] + a[n + i] - value_list[pos]\nend\n-- r\nvalue_list, value_to_idx = {}, {}\nfor i = n + 1, n * 3 do\n  if not value_to_idx[-a[i]] then\n    value_to_idx[-a[i]] = true\n    table.insert(value_list, -a[i])\n  end\nend\ntable.sort(value_list)\nvalue_to_idx = {}\nfor i = 1, #value_list do value_to_idx[value_list[i]] = i end\nlocal st = nil\nlocal rightsum = 0\ndo\n  local stary = {}\n  for i = 1, #value_list do stary[i] = 0 end\n  for i = 2 * n + 1, n * 3 do\n    stary[value_to_idx[-a[i]]] = stary[value_to_idx[-a[i]]] + 1\n    rightsum = rightsum - a[i]\n  end\n  st = SegTree.new(stary, function(a,b)return a+b end, 0)\nend\nrightsum = {rightsum}\nfor i = n, 1, -1 do\n  st:addValue(value_to_idx[-a[n + i]], 1)\n  local pos = st:takeLeft()\n  rightsum[n + 2 - i] = rightsum[n + 1 - i] - a[n + i] - value_list[pos]\nend\nlocal ret = leftsum[1] + rightsum[n + 1]\nfor i = 2, n + 1 do\n  ret = mma(ret, leftsum[i] + rightsum[n + 2 - i])\nend\nprint(ret)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3894, "cpu_time_ms": 853, "memory_kb": 61204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s196089179", "group_id": "codeNet:p03814", "input_text": "s=io.read()\nlarge=string.len(s)\nnuma = string.find(s, \"A\")\nnumz = large - string.find(string.reverse(s),\"Z\")\nprint(numz-numa+2)", "language": "Lua", "metadata": {"date": 1588586371, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s196089179.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196089179", "user_id": "u540534068"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "s=io.read()\nlarge=string.len(s)\nnuma = string.find(s, \"A\")\nnumz = large - string.find(string.reverse(s),\"Z\")\nprint(numz-numa+2)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s929884403", "group_id": "codeNet:p03814", "input_text": "local s = io.read(\"*l\")\n\nlocal A_index = s:find(\"A\")\nlocal Z_index = s:len() - s:reverse():find(\"Z\") + 1\n\nprint(Z_index - A_index + 1)", "language": "Lua", "metadata": {"date": 1587079461, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s929884403.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s929884403", "user_id": "u793881115"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read(\"*l\")\n\nlocal A_index = s:find(\"A\")\nlocal Z_index = s:len() - s:reverse():find(\"Z\") + 1\n\nprint(Z_index - A_index + 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s096755699", "group_id": "codeNet:p03814", "input_text": "local str = io.read(\"*l\")\nlocal a, z = 0, 0\nlocal flag = false\nfor i = 1, #str do\n  local char = string.sub(str, i, i)\n  if flag == false and char == \"A\" then\n    flag = true\n    a = i\n  elseif char == \"Z\" then\n    z = i\n  end\nend\nlocal ans = z - a + 1\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1572925769, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s096755699.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s096755699", "user_id": "u413686817"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read(\"*l\")\nlocal a, z = 0, 0\nlocal flag = false\nfor i = 1, #str do\n  local char = string.sub(str, i, i)\n  if flag == false and char == \"A\" then\n    flag = true\n    a = i\n  elseif char == \"Z\" then\n    z = i\n  end\nend\nlocal ans = z - a + 1\nprint(ans)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s964619594", "group_id": "codeNet:p03814", "input_text": "local str = io.read(\"*l\")\nlocal a, z = 0, 0\nlocal flag = false\nfor i = 1, #str do\n  local char = string.sub(str, i, i)\n  if flag == false and char == \"a\" then\n    flag = true\n    a = i\n  elseif char == \"z\" then\n    z = i\n  end\nend\nlocal ans = z - a + 1\nprint(ans)", "language": "Lua", "metadata": {"date": 1572925649, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s964619594.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s964619594", "user_id": "u413686817"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read(\"*l\")\nlocal a, z = 0, 0\nlocal flag = false\nfor i = 1, #str do\n  local char = string.sub(str, i, i)\n  if flag == false and char == \"a\" then\n    flag = true\n    a = i\n  elseif char == \"z\" then\n    z = i\n  end\nend\nlocal ans = z - a + 1\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 34, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s689675745", "group_id": "codeNet:p03814", "input_text": "local s = io.read()\nlocal a = s:find(\"A\")\nlocal _, zr = s:reverse():find(\"Z\")\nlocal z = #s-(zr-1) \nprint(z-a+1)", "language": "Lua", "metadata": {"date": 1570940038, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s689675745.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s689675745", "user_id": "u162773977"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read()\nlocal a = s:find(\"A\")\nlocal _, zr = s:reverse():find(\"Z\")\nlocal z = #s-(zr-1) \nprint(z-a+1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s992417726", "group_id": "codeNet:p03814", "input_text": "local s = io.read()\nlocal left = s:find(\"A\")\nlocal right = s:find(\"Z\")\nlocal c = right + 1\nwhile c do\n  c = s:find(\"Z\", c)\n  if c then\n    right = c\n    c = c + 1\n  end\nend\nprint(right - left + 1)\n", "language": "Lua", "metadata": {"date": 1563713962, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s992417726.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992417726", "user_id": "u120582723"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read()\nlocal left = s:find(\"A\")\nlocal right = s:find(\"Z\")\nlocal c = right + 1\nwhile c do\n  c = s:find(\"Z\", c)\n  if c then\n    right = c\n    c = c + 1\n  end\nend\nprint(right - left + 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646378849", "group_id": "codeNet:p03814", "input_text": "\ns = io.read(\"*n\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1553554178, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s646378849.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s646378849", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\ns = io.read(\"*n\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\nprint(ret)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s972461804", "group_id": "codeNet:p03814", "input_text": "\ns = io.read(\"*l\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\nprint(ret)", "language": "Lua", "metadata": {"date": 1553554107, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s972461804.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972461804", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\ns = io.read(\"*l\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\nprint(ret)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s685626195", "group_id": "codeNet:p03814", "input_text": "s = io.read(\"*l\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\n", "language": "Lua", "metadata": {"date": 1553554084, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s685626195.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s685626195", "user_id": "u018679195"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "s = io.read(\"*l\")\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 51, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s657475079", "group_id": "codeNet:p03814", "input_text": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nif not spos then\n\tprint(0)\nend\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos or (spos > epos) then\n\tprint(0)\nend\n\nprint(epos - spos + 1)", "language": "Lua", "metadata": {"date": 1553129596, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s657475079.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s657475079", "user_id": "u353919145"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nif not spos then\n\tprint(0)\nend\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos or (spos > epos) then\n\tprint(0)\nend\n\nprint(epos - spos + 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 18, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s221444670", "group_id": "codeNet:p03814", "input_text": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nif not spos then\n\treturn 0\nend\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos or (spos > epos) then\n\treturn 0\nend\n\nreturn epos - spos + 1", "language": "Lua", "metadata": {"date": 1553129008, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s221444670.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s221444670", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nif not spos then\n\treturn 0\nend\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos or (spos > epos) then\n\treturn 0\nend\n\nreturn epos - spos + 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 17, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s285472690", "group_id": "codeNet:p03814", "input_text": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos then\n\treturn 0\nend\n\nreturn epos - spos + 1", "language": "Lua", "metadata": {"date": 1553128707, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s285472690.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s285472690", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read()\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nfor i=string.len(str), spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos then\n\treturn 0\nend\n\nreturn epos - spos + 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s098959896", "group_id": "codeNet:p03814", "input_text": "local str = io.read(\"*a\")\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nfor i=string.len(str),spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos then\n\treturn 0\nend\n\nreturn epos - spos + 1", "language": "Lua", "metadata": {"date": 1553128093, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s098959896.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s098959896", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read(\"*a\")\nlocal spos = string.find(str, \"A\")\nlocal epos\n\nfor i=string.len(str),spos + 1, -1 do\n\tlocal v = string.sub(str, i, i)\n\tif v == \"Z\" then\n\t\tepos = i\n\t\tbreak\n\tend\nend\n\nif not epos then\n\treturn 0\nend\n\nreturn epos - spos + 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 245, "cpu_time_ms": 17, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s553323880", "group_id": "codeNet:p03814", "input_text": "\ns = io.read()\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\n\nprint(ret)", "language": "Lua", "metadata": {"date": 1553127887, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s553323880.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553323880", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\ns = io.read()\ncount = 0\nret = 0\nstart = false\nfor i = 1, #s do\n\tc = string.sub(s, i, i)\n\tif start then\n\t\tcount = count + 1\n\t\tif  c == \"Z\" then\n\t\t\tret = count\n\t\tend\n\telseif c == \"A\" then\n\t\tstart = true\n\t\tcount = 1\n\tend\nend\n\nprint(ret)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 53, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s636412470", "group_id": "codeNet:p03814", "input_text": "local s = io.read()\n\nlocal function getAAA(str)\n\tlocal len = string.len(str)\n\tlocal p = string.find(str, \"A\")\n\tif not p then\n\t\treturn 0\n\tend\n\tlocal p2 = string.find(str, \"Z[[a-y]*[A-Y]*$\")\n\tif not p2 then\n\t\treturn 0\n\tend\n\tlocal n = len - p - (len - p2) + 1\n\treturn n\nend\n\nlocal n = getAAA(s)\nprint(n)", "language": "Lua", "metadata": {"date": 1553127879, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s636412470.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636412470", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local s = io.read()\n\nlocal function getAAA(str)\n\tlocal len = string.len(str)\n\tlocal p = string.find(str, \"A\")\n\tif not p then\n\t\treturn 0\n\tend\n\tlocal p2 = string.find(str, \"Z[[a-y]*[A-Y]*$\")\n\tif not p2 then\n\t\treturn 0\n\tend\n\tlocal n = len - p - (len - p2) + 1\n\treturn n\nend\n\nlocal n = getAAA(s)\nprint(n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s435029988", "group_id": "codeNet:p03814", "input_text": "local str = io.read(\"*l\")\nlocal reverse = string.reverse(str)\nlocal len = string.len(str)\nlocal apos = string.find(str,\"A\")\nlocal zpos = len - string.find(reverse,\"Z\") + 1\nprint(zpos - apos +1)\n", "language": "Lua", "metadata": {"date": 1553127605, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lua/s435029988.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435029988", "user_id": "u353919145"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "local str = io.read(\"*l\")\nlocal reverse = string.reverse(str)\nlocal len = string.len(str)\nlocal apos = string.find(str,\"A\")\nlocal zpos = len - string.find(reverse,\"Z\") + 1\nprint(zpos - apos +1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 2, "memory_kb": 836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s566490555", "group_id": "codeNet:p03835", "input_text": "local k,s=io.read(\"*n\",\"*n\")\nlocal counter=0\nfor x=0,k do\n    for y=0,k do\n        local z=s-x-y\n        counter=counter+(k>=z and z>=0 and 1 or 0)\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1590843950, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s566490555.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566490555", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local k,s=io.read(\"*n\",\"*n\")\nlocal counter=0\nfor x=0,k do\n    for y=0,k do\n        local z=s-x-y\n        counter=counter+(k>=z and z>=0 and 1 or 0)\n    end\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s179857940", "group_id": "codeNet:p03835", "input_text": "local k,s=io.read(\"n\",\"n\")\nlocal counter=0\nfor x=0,k do\n    for y=0,k do\n        local z=s-x-y\n        counter=counter+(k>=z and z>=0 and 1 or 0)\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1590843596, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s179857940.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179857940", "user_id": "u045238009"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local k,s=io.read(\"n\",\"n\")\nlocal counter=0\nfor x=0,k do\n    for y=0,k do\n        local z=s-x-y\n        counter=counter+(k>=z and z>=0 and 1 or 0)\n    end\nend\nprint(counter)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 479, "memory_kb": 632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s075049530", "group_id": "codeNet:p03835", "input_text": "local K, S = io.read(\"*n\", \"*n\")\n\nlocal ans = 0\n\nfor x = 0, K do\n\tfor y = 0, K do\n\t\tlocal z = S - x -y\n\t\tif (0 <= z and z <= K) then\n\t\t\tans = ans + 1\n\t\tend\n\tend\nend\n\nprint(ans)", "language": "Lua", "metadata": {"date": 1588347881, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s075049530.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075049530", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local K, S = io.read(\"*n\", \"*n\")\n\nlocal ans = 0\n\nfor x = 0, K do\n\tfor y = 0, K do\n\t\tlocal z = S - x -y\n\t\tif (0 <= z and z <= K) then\n\t\t\tans = ans + 1\n\t\tend\n\tend\nend\n\nprint(ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s360151017", "group_id": "codeNet:p03835", "input_text": "local K, S = io.read(\"*n\", \"*n\")\n\n---x >= y >= z\nlocal x, y, z = 0, 0, 0\nif K >= S then\n\tx = S\nelseif 2*K >= S then\n\tx, y = K, S - K\nelse\n\tx, y, z = K, K, S - 2*K\nend\n\nlocal count = 0\nlocal sub_x, sub_y, sub_z = x, y, z\nwhile sub_y >= sub_z do\n\twhile y >= z do\n\t\tif x == y and y == z then\n\t\t\tcount = count + 1\n\t\telseif x == y or y == z then\n\t\t\tcount = count + 3\n\t\telse\n\t\t\tcount = count + 6\n\t\tend\n\t\ty, z = y - 1, z + 1\n\tend\n\n\tif sub_x == sub_y + 1 then\n\t\tsub_x, sub_z = sub_x - 1, sub_z + 1\n\telseif x == sub_y then\n\t\tsub_x, sub_y, sub_z = sub_x - 1, sub_y - 1, sub_z + 2\n\telse\n\t\tsub_x, sub_y = sub_x - 1, sub_y + 1\n\tend\n\tx, y, z = sub_x, sub_y, sub_z\nend\n\nprint(count)", "language": "Lua", "metadata": {"date": 1588346694, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s360151017.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360151017", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local K, S = io.read(\"*n\", \"*n\")\n\n---x >= y >= z\nlocal x, y, z = 0, 0, 0\nif K >= S then\n\tx = S\nelseif 2*K >= S then\n\tx, y = K, S - K\nelse\n\tx, y, z = K, K, S - 2*K\nend\n\nlocal count = 0\nlocal sub_x, sub_y, sub_z = x, y, z\nwhile sub_y >= sub_z do\n\twhile y >= z do\n\t\tif x == y and y == z then\n\t\t\tcount = count + 1\n\t\telseif x == y or y == z then\n\t\t\tcount = count + 3\n\t\telse\n\t\t\tcount = count + 6\n\t\tend\n\t\ty, z = y - 1, z + 1\n\tend\n\n\tif sub_x == sub_y + 1 then\n\t\tsub_x, sub_z = sub_x - 1, sub_z + 1\n\telseif x == sub_y then\n\t\tsub_x, sub_y, sub_z = sub_x - 1, sub_y - 1, sub_z + 2\n\telse\n\t\tsub_x, sub_y = sub_x - 1, sub_y + 1\n\tend\n\tx, y, z = sub_x, sub_y, sub_z\nend\n\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 667, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s377236414", "group_id": "codeNet:p03835", "input_text": "local K, S = io.read(\"*n\", \"*n\")\n\n---x >= y >= z\nlocal x, y, z = 0, 0, 0\nif K >= S then\n\tx = S\nelseif 2*K >= S then\n\tx, y = K, S - K\nelse\n\tx, y, z = K, K, S - 2*K\nend\n\nlocal count = 0\nlocal sub_y, sub_z = y, z\nwhile x >= y and y >= z do\n\twhile y >= z do\n\t\tif x == y and y == z then\n\t\t\tcount = count + 1\n\t\telseif x == y or y == z then\n\t\t\tcount = count + 3\n\t\telse\n\t\t\tcount = count + 6\n\t\tend\n\t\ty, z = y - 1, z + 1\n\tend\n\ty, z = sub_y, sub_z\n\tif x == y + 1 then\n\t\tx, z = x - 1, z + 1\n\telseif x == y then\n\t\tx, y, z = x - 1, y - 1, z + 2\n\telse\n\t\tx, y = x - 1, y + 1\n\tend\n\tsub_y, sub_z = y, z\nend\n\nprint(count)", "language": "Lua", "metadata": {"date": 1588345598, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s377236414.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377236414", "user_id": "u793881115"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local K, S = io.read(\"*n\", \"*n\")\n\n---x >= y >= z\nlocal x, y, z = 0, 0, 0\nif K >= S then\n\tx = S\nelseif 2*K >= S then\n\tx, y = K, S - K\nelse\n\tx, y, z = K, K, S - 2*K\nend\n\nlocal count = 0\nlocal sub_y, sub_z = y, z\nwhile x >= y and y >= z do\n\twhile y >= z do\n\t\tif x == y and y == z then\n\t\t\tcount = count + 1\n\t\telseif x == y or y == z then\n\t\t\tcount = count + 3\n\t\telse\n\t\t\tcount = count + 6\n\t\tend\n\t\ty, z = y - 1, z + 1\n\tend\n\ty, z = sub_y, sub_z\n\tif x == y + 1 then\n\t\tx, z = x - 1, z + 1\n\telseif x == y then\n\t\tx, y, z = x - 1, y - 1, z + 2\n\telse\n\t\tx, y = x - 1, y + 1\n\tend\n\tsub_y, sub_z = y, z\nend\n\nprint(count)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 602, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s084652498", "group_id": "codeNet:p03835", "input_text": "local k, s = io.read(\"*n\", \"*n\")\nlocal ret = (s + 2) * (s + 1) // 2\nif k + 1 <= s then\n  local a = s - (k + 1)\n  ret = ret - 3 * (a + 2) * (a + 1) // 2\nend\nif 2 * (k + 1) <= s then\n  local a = s - 2 * (k + 1)\n  ret = ret + 3 * (a + 2) * (a + 1) // 2\nend\nif 3 * (k + 1) <= s then\n  local a = s - 3 * (k + 1)\n  ret = ret - (a + 2) * (a + 1) // 2\nend\nprint(ret)\n", "language": "Lua", "metadata": {"date": 1584313487, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s084652498.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s084652498", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local k, s = io.read(\"*n\", \"*n\")\nlocal ret = (s + 2) * (s + 1) // 2\nif k + 1 <= s then\n  local a = s - (k + 1)\n  ret = ret - 3 * (a + 2) * (a + 1) // 2\nend\nif 2 * (k + 1) <= s then\n  local a = s - 2 * (k + 1)\n  ret = ret + 3 * (a + 2) * (a + 1) // 2\nend\nif 3 * (k + 1) <= s then\n  local a = s - 3 * (k + 1)\n  ret = ret - (a + 2) * (a + 1) // 2\nend\nprint(ret)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s073133769", "group_id": "codeNet:p03835", "input_text": "local mfl = math.floor\nlocal TranFFT = {}\n\nTranFFT.initialize = function(self)\n  self.size = 18\n  -- 2^18\n  self.n = 262144\n  -- 1007681537: prime,\n  -- 1007681537 % 262144 = 1\n  self.mod = 1007681537\n  -- (6161^262144) % mod = 1\n  self.w = 6161\n  -- (1007677693 * 262144) % mod = 1\n  self.ninv = 1007677693\n  -- (534835031 * 6161) % mod = 1\n  self.winv = 534835031\n  self.p2 = {1}\n  for i = 2, self.size do\n    self.p2[i] = self.p2[i - 1] * 2\n  end\n  self.binv = {}\n  for i = 1, self.n do\n    local y, z = 0, i - 1\n    for j = 1, self.size do\n      y = y + (z % 2) * self.p2[self.size + 1 - j]\n      z = mfl(z / 2)\n    end\n    self.binv[i] = y + 1\n  end\n  self.wmul = {1}\n  for i = 2, self.n do\n    self.wmul[i] = self:mul(self.wmul[i - 1], self.w)\n  end\n  self.winvmul = {1}\n  for i = 2, self.n do\n    self.winvmul[i] = self:mul(self.winvmul[i - 1], self.winv)\n  end\nend\n\n-- (44893^2) % 1007681537 = 18375\n-- 1007681537 = 22446 * 44893 + rem(13259)\n-- x0, y0 <= 44892\n-- x1, y1 <= 22446\n-- max(x1y1*18375+(x1y0+x0y1)*44893+x0y0) < 10^14\nTranFFT.mul = function(self, x, y)\n  local x0, y0 = x % 44893, y % 44893\n  local x1, y1 = mfl(x / 44893), mfl(y / 44893)\n  return (x1 * y1 * 18375 + (x1 * y0 + x0 * y1) * 44893 + x0 * y0) % self.mod\nend\n\nTranFFT.add = function(self, x, y) return (x + y) % self.mod end\n\nTranFFT.fft_common = function(self, ary, wmul)\n  local ret = {}\n  for i = 1, self.n do\n    ret[i] = ary[self.binv[i]]\n  end\n  for i = 1, self.size do\n    local step_size = self.p2[i]\n    local step_count = self.p2[self.size + 1 - i]\n    for istep = 1, step_count do\n      local ofst = (istep - 1) * step_size * 2\n      for j = 1, step_size do\n        local a1, a2 = ret[ofst + j], ret[ofst + step_size + j]\n        ret[ofst + j] = self:add(a1, self:mul(a2, wmul[1 + (j - 1) * step_count]))\n        ret[ofst + step_size + j] = self:add(a1, self:mul(a2, wmul[1 + (j + step_size - 1) * step_count]))\n      end\n    end\n  end\n  return ret\nend\n\nTranFFT.fft = function(self, ary)\n  return self:fft_common(ary, self.wmul)\nend\nTranFFT.ifft = function(self, ary)\n  local ret = self:fft_common(ary, self.winvmul)\n  for i = 1, self.n do\n    ret[i] = self:mul(ret[i], self.ninv)\n  end\n  return ret\nend\n\nTranFFT:initialize()\nlocal a = {}\nfor i = 1, TranFFT.n do\n  a[i] = 0\nend\nlocal k, s = io.read(\"*n\", \"*n\")\nfor i = 1, k + 1 do\n  a[i] = 1\nend\n\nlocal at = TranFFT:fft(a)\nfor i = 1, TranFFT.n do\n  local z = at[i]\n  at[i] = TranFFT:mul(z, TranFFT:mul(z, z))\nend\nlocal b = TranFFT:ifft(at)\nprint(b[s + 1])\n", "language": "Lua", "metadata": {"date": 1584312026, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lua/s073133769.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s073133769", "user_id": "u120582723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "local mfl = math.floor\nlocal TranFFT = {}\n\nTranFFT.initialize = function(self)\n  self.size = 18\n  -- 2^18\n  self.n = 262144\n  -- 1007681537: prime,\n  -- 1007681537 % 262144 = 1\n  self.mod = 1007681537\n  -- (6161^262144) % mod = 1\n  self.w = 6161\n  -- (1007677693 * 262144) % mod = 1\n  self.ninv = 1007677693\n  -- (534835031 * 6161) % mod = 1\n  self.winv = 534835031\n  self.p2 = {1}\n  for i = 2, self.size do\n    self.p2[i] = self.p2[i - 1] * 2\n  end\n  self.binv = {}\n  for i = 1, self.n do\n    local y, z = 0, i - 1\n    for j = 1, self.size do\n      y = y + (z % 2) * self.p2[self.size + 1 - j]\n      z = mfl(z / 2)\n    end\n    self.binv[i] = y + 1\n  end\n  self.wmul = {1}\n  for i = 2, self.n do\n    self.wmul[i] = self:mul(self.wmul[i - 1], self.w)\n  end\n  self.winvmul = {1}\n  for i = 2, self.n do\n    self.winvmul[i] = self:mul(self.winvmul[i - 1], self.winv)\n  end\nend\n\n-- (44893^2) % 1007681537 = 18375\n-- 1007681537 = 22446 * 44893 + rem(13259)\n-- x0, y0 <= 44892\n-- x1, y1 <= 22446\n-- max(x1y1*18375+(x1y0+x0y1)*44893+x0y0) < 10^14\nTranFFT.mul = function(self, x, y)\n  local x0, y0 = x % 44893, y % 44893\n  local x1, y1 = mfl(x / 44893), mfl(y / 44893)\n  return (x1 * y1 * 18375 + (x1 * y0 + x0 * y1) * 44893 + x0 * y0) % self.mod\nend\n\nTranFFT.add = function(self, x, y) return (x + y) % self.mod end\n\nTranFFT.fft_common = function(self, ary, wmul)\n  local ret = {}\n  for i = 1, self.n do\n    ret[i] = ary[self.binv[i]]\n  end\n  for i = 1, self.size do\n    local step_size = self.p2[i]\n    local step_count = self.p2[self.size + 1 - i]\n    for istep = 1, step_count do\n      local ofst = (istep - 1) * step_size * 2\n      for j = 1, step_size do\n        local a1, a2 = ret[ofst + j], ret[ofst + step_size + j]\n        ret[ofst + j] = self:add(a1, self:mul(a2, wmul[1 + (j - 1) * step_count]))\n        ret[ofst + step_size + j] = self:add(a1, self:mul(a2, wmul[1 + (j + step_size - 1) * step_count]))\n      end\n    end\n  end\n  return ret\nend\n\nTranFFT.fft = function(self, ary)\n  return self:fft_common(ary, self.wmul)\nend\nTranFFT.ifft = function(self, ary)\n  local ret = self:fft_common(ary, self.winvmul)\n  for i = 1, self.n do\n    ret[i] = self:mul(ret[i], self.ninv)\n  end\n  return ret\nend\n\nTranFFT:initialize()\nlocal a = {}\nfor i = 1, TranFFT.n do\n  a[i] = 0\nend\nlocal k, s = io.read(\"*n\", \"*n\")\nfor i = 1, k + 1 do\n  a[i] = 1\nend\n\nlocal at = TranFFT:fft(a)\nfor i = 1, TranFFT.n do\n  local z = at[i]\n  at[i] = TranFFT:mul(z, TranFFT:mul(z, z))\nend\nlocal b = TranFFT:ifft(at)\nprint(b[s + 1])\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2500, "cpu_time_ms": 234, "memory_kb": 12672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s387224711", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"erase(r?)\", \"\"):gsub(\"dream[er]?\",\"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590330185, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s387224711.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s387224711", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"erase(r?)\", \"\"):gsub(\"dream[er]?\",\"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s396882735", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"erase(r-)\",\"\"):gsub(\"dream(e-)(r-)\",\"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590329701, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s396882735.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396882735", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"erase(r-)\",\"\"):gsub(\"dream(e-)(r-)\",\"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s668467868", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"erase(r-)\",\"\"):gsub(\"dream[er]-\",\"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590329559, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s668467868.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s668467868", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"erase(r-)\",\"\"):gsub(\"dream[er]-\",\"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 4, "memory_kb": 532}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s622300709", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"erase(r*)\",\"\"):gsub(\"dream[er]*\",\"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590329202, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s622300709.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s622300709", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"erase(r*)\",\"\"):gsub(\"dream[er]*\",\"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s548634139", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"[ed]r[ae]a*[sm]e*r*\", \"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590328397, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s548634139.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s548634139", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"[ed]r[ae]a*[sm]e*r*\", \"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s398247849", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"[ed]r[ae]a*[sm]e*r*\", \"\"))", "language": "Lua", "metadata": {"date": 1590328357, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s398247849.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s398247849", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"[ed]r[ae]a*[sm]e*r*\", \"\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s646033778", "group_id": "codeNet:p03854", "input_text": "print(io.read():gsub(\"eraser\",\"\"):gsub(\"erase\",\"\"):gsub(\"dreamer\",\"\"):gsub(\"dream\",\"\")==\"\" and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1590327888, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s646033778.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646033778", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print(io.read():gsub(\"eraser\",\"\"):gsub(\"erase\",\"\"):gsub(\"dreamer\",\"\"):gsub(\"dream\",\"\")==\"\" and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s068627216", "group_id": "codeNet:p03854", "input_text": "local s=io.read()\nlocal daydream={\"dream\",\"dreamer\",\"erase\",\"eraser\"}\n\nwhile true do\n    local flag=false\n    for j=1,4 do\n        local l=#s-#daydream[j]\n        if s:sub(l+1)==daydream[j] then\n            s=s:sub(1,l)\n            flag=true\n        end\n    end\n    if not flag then\n        print(\"NO\")\n        break\n    elseif s==\"\" then\n        print(\"YES\")\n        break\n    end\nend", "language": "Lua", "metadata": {"date": 1590303189, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s068627216.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068627216", "user_id": "u045238009"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local s=io.read()\nlocal daydream={\"dream\",\"dreamer\",\"erase\",\"eraser\"}\n\nwhile true do\n    local flag=false\n    for j=1,4 do\n        local l=#s-#daydream[j]\n        if s:sub(l+1)==daydream[j] then\n            s=s:sub(1,l)\n            flag=true\n        end\n    end\n    if not flag then\n        print(\"NO\")\n        break\n    elseif s==\"\" then\n        print(\"YES\")\n        break\n    end\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 97, "memory_kb": 908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s470730890", "group_id": "codeNet:p03854", "input_text": "local long_str = io.read(\"*l\")\nlocal tmps = {\"dream\", \"dreamer\", \"erase\", \"eraser\"}\n\nlong_str = long_str:reverse()\nfor i = 1, #tmps do\n    tmps[i] = string.reverse(tmps[i])\nend\n\nlocal index = 1\nlocal is_none = false\nwhile index < long_str:len() do\n    local old_index = index\n    for i = 1, #tmps do\n        local tmp = tmps[i]\n        if long_str:sub(index, index + string.len(tmp) - 1) == tmp then\n            index = index + string.len(tmp)\n            break\n        end\n    end\n    if old_index == index then\n        is_none = true\n        break\n    end\nend\nprint(is_none and \"NO\" or \"YES\")", "language": "Lua", "metadata": {"date": 1586536047, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s470730890.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s470730890", "user_id": "u793881115"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local long_str = io.read(\"*l\")\nlocal tmps = {\"dream\", \"dreamer\", \"erase\", \"eraser\"}\n\nlong_str = long_str:reverse()\nfor i = 1, #tmps do\n    tmps[i] = string.reverse(tmps[i])\nend\n\nlocal index = 1\nlocal is_none = false\nwhile index < long_str:len() do\n    local old_index = index\n    for i = 1, #tmps do\n        local tmp = tmps[i]\n        if long_str:sub(index, index + string.len(tmp) - 1) == tmp then\n            index = index + string.len(tmp)\n            break\n        end\n    end\n    if old_index == index then\n        is_none = true\n        break\n    end\nend\nprint(is_none and \"NO\" or \"YES\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s454985963", "group_id": "codeNet:p03854", "input_text": "local long_str = io.read(\"*l\")\nlocal tmps = {\"dream\", \"dreamer\", \"erase\", \"eraser\"}\n\nlong_str = long_str:reverse()\nfor i = 1, #tmps do\n    tmps[i] = string.reverse(tmps[i])\nend\n\nlocal index = 1\nlocal is_none = false\nwhile index < long_str:len() do\n    local old_index = index\n    for i = 1, #tmps do\n        local tmp = tmps[i]\n        if long_str:sub(index, index + string.len(tmp) - 1) == tmp then\n            index = index + string.len(tmp)\n            break\n        end\n    end\n    if old_index == index then\n        is_none = true\n        break\n    end\nend\nprint(is_none and \"No\" or \"Yes\")", "language": "Lua", "metadata": {"date": 1586535978, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s454985963.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s454985963", "user_id": "u793881115"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local long_str = io.read(\"*l\")\nlocal tmps = {\"dream\", \"dreamer\", \"erase\", \"eraser\"}\n\nlong_str = long_str:reverse()\nfor i = 1, #tmps do\n    tmps[i] = string.reverse(tmps[i])\nend\n\nlocal index = 1\nlocal is_none = false\nwhile index < long_str:len() do\n    local old_index = index\n    for i = 1, #tmps do\n        local tmp = tmps[i]\n        if long_str:sub(index, index + string.len(tmp) - 1) == tmp then\n            index = index + string.len(tmp)\n            break\n        end\n    end\n    if old_index == index then\n        is_none = true\n        break\n    end\nend\nprint(is_none and \"No\" or \"Yes\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s749393662", "group_id": "codeNet:p03854", "input_text": "s = io.read()\ns = s:gsub(\"eraser\", \"\")\ns = s:gsub(\"erase\", \"\")\ns = s:gsub(\"dreamer\", \"\")\ns = s:gsub(\"dream\", \"\")\nprint(s == \"\" and \"YES\" or \"NO\")\n", "language": "Lua", "metadata": {"date": 1581829042, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s749393662.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749393662", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "s = io.read()\ns = s:gsub(\"eraser\", \"\")\ns = s:gsub(\"erase\", \"\")\ns = s:gsub(\"dreamer\", \"\")\ns = s:gsub(\"dream\", \"\")\nprint(s == \"\" and \"YES\" or \"NO\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s576128677", "group_id": "codeNet:p03854", "input_text": "s = io.read()\ns = s:gsub(\"eraser\", \"\")\ns = s:gsub(\"dreamer\", \"\")\ns = s:gsub(\"dream\", \"\")\ns = s:gsub(\"erase\", \"\")\nprint(s == \"\" and \"YES\" or \"NO\")\n", "language": "Lua", "metadata": {"date": 1581829009, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s576128677.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s576128677", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "s = io.read()\ns = s:gsub(\"eraser\", \"\")\ns = s:gsub(\"dreamer\", \"\")\ns = s:gsub(\"dream\", \"\")\ns = s:gsub(\"erase\", \"\")\nprint(s == \"\" and \"YES\" or \"NO\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s433155204", "group_id": "codeNet:p03854", "input_text": "s = io.read()\ns = string.gsub(s, \"eraser\", \"\")\ns = string.gsub(s, \"erase\", \"\")\ns = string.gsub(s, \"dreamer\", \"\")\ns = string.gsub(s, \"dream\", \"\")\nprint(string.len(s) == 0 and \"YES\" or \"NO\")", "language": "Lua", "metadata": {"date": 1554684160, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s433155204.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s433155204", "user_id": "u120582723"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "s = io.read()\ns = string.gsub(s, \"eraser\", \"\")\ns = string.gsub(s, \"erase\", \"\")\ns = string.gsub(s, \"dreamer\", \"\")\ns = string.gsub(s, \"dream\", \"\")\nprint(string.len(s) == 0 and \"YES\" or \"NO\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s287774993", "group_id": "codeNet:p03854", "input_text": "local t\ndo\n  local _accum_0 = { }\n  local _len_0 = 1\n  local _list_0 = {\n    \"dream\",\n    \"dreamer\",\n    \"erase\",\n    \"eraser\"\n  }\n  for _index_0 = 1, #_list_0 do\n    local e = _list_0[_index_0]\n    _accum_0[_len_0] = e:reverse()\n    _len_0 = _len_0 + 1\n  end\n  t = _accum_0\nend\nlocal s = io.read(\"*l\"):reverse()\nlocal c = 1\nlocal l = s:len()\nwhile c <= l do\n  local k = nil\n  for _index_0 = 1, #t do\n    local e = t[_index_0]\n    if s:sub(c, c + e:len() - 1) == e then\n      k = e\n      break\n    end\n  end\n  if k == nil then\n    print(\"NO\")\n    return \n  end\n  c = c + k:len()\nend\nreturn print(\"YES\")\n", "language": "Lua", "metadata": {"date": 1529109560, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s287774993.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s287774993", "user_id": "u280667879"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local t\ndo\n  local _accum_0 = { }\n  local _len_0 = 1\n  local _list_0 = {\n    \"dream\",\n    \"dreamer\",\n    \"erase\",\n    \"eraser\"\n  }\n  for _index_0 = 1, #_list_0 do\n    local e = _list_0[_index_0]\n    _accum_0[_len_0] = e:reverse()\n    _len_0 = _len_0 + 1\n  end\n  t = _accum_0\nend\nlocal s = io.read(\"*l\"):reverse()\nlocal c = 1\nlocal l = s:len()\nwhile c <= l do\n  local k = nil\n  for _index_0 = 1, #t do\n    local e = t[_index_0]\n    if s:sub(c, c + e:len() - 1) == e then\n      k = e\n      break\n    end\n  end\n  if k == nil then\n    print(\"NO\")\n    return \n  end\n  c = c + k:len()\nend\nreturn print(\"YES\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s320745554", "group_id": "codeNet:p03854", "input_text": "local t\ndo\n  local _accum_0 = { }\n  local _len_0 = 1\n  local _list_0 = {\n    \"dream\",\n    \"dreamer\",\n    \"erase\",\n    \"eraser\"\n  }\n  for _index_0 = 1, #_list_0 do\n    local e = _list_0[_index_0]\n    _accum_0[_len_0] = e:reverse()\n    _len_0 = _len_0 + 1\n  end\n  t = _accum_0\nend\nlocal s = io.read(\"*l\"):reverse()\nlocal c = 1\nlocal l = s:len()\nwhile c <= l do\n  local k = nil\n  for _index_0 = 1, #t do\n    local e = t[_index_0]\n    if s:sub(c, c + e:len() - 1) == e then\n      k = e\n      break\n    end\n  end\n  if k == nil then\n    print(\"NO\")\n    return \n  end\n  c = c + k:len()\nend\nreturn print(\"YES\")\n", "language": "Lua", "metadata": {"date": 1529109553, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lua/s320745554.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320745554", "user_id": "u280667879"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "local t\ndo\n  local _accum_0 = { }\n  local _len_0 = 1\n  local _list_0 = {\n    \"dream\",\n    \"dreamer\",\n    \"erase\",\n    \"eraser\"\n  }\n  for _index_0 = 1, #_list_0 do\n    local e = _list_0[_index_0]\n    _accum_0[_len_0] = e:reverse()\n    _len_0 = _len_0 + 1\n  end\n  t = _accum_0\nend\nlocal s = io.read(\"*l\"):reverse()\nlocal c = 1\nlocal l = s:len()\nwhile c <= l do\n  local k = nil\n  for _index_0 = 1, #t do\n    local e = t[_index_0]\n    if s:sub(c, c + e:len() - 1) == e then\n      k = e\n      break\n    end\n  end\n  if k == nil then\n    print(\"NO\")\n    return \n  end\n  c = c + k:len()\nend\nreturn print(\"YES\")\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 532}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s419686114", "group_id": "codeNet:p03881", "input_text": "local a, b = {}, {}\nfor i = 1, 6 do a[i] = io.read(\"*n\") / 100 end\nfor i = 1, 6 do b[i] = io.read(\"*n\") / 100 end\nlocal red, blue = 0, 0\nfor i = 1, 6 do\n  local r = a[i] / (a[i] + b[i])\n  r = math.max(r, 1 - r)\n  red = red + a[i] * r\n  blue = blue + b[i] * r\nend\nprint(string.format(\"%.10f\", math.min(red, blue)))\n", "language": "Lua", "metadata": {"date": 1579101099, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03881.html", "problem_id": "p03881", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03881/input.txt", "sample_output_relpath": "derived/input_output/data/p03881/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03881/Lua/s419686114.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s419686114", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "local a, b = {}, {}\nfor i = 1, 6 do a[i] = io.read(\"*n\") / 100 end\nfor i = 1, 6 do b[i] = io.read(\"*n\") / 100 end\nlocal red, blue = 0, 0\nfor i = 1, 6 do\n  local r = a[i] / (a[i] + b[i])\n  r = math.max(r, 1 - r)\n  red = red + a[i] * r\n  blue = blue + b[i] * r\nend\nprint(string.format(\"%.10f\", math.min(red, blue)))\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nThere are two (6-sided) dice: a red die and a blue die.\nWhen a red die is rolled, it shows i with probability p_i percents, and when a blue die is rolled, it shows j with probability q_j percents.\n\nPetr and tourist are playing the following game.\nBoth players know the probabilistic distributions of the two dice.\nFirst, Petr chooses a die in his will (without showing it to tourist), rolls it, and tells tourist the number it shows.\nThen, tourist guesses the color of the chosen die.\nIf he guesses the color correctly, tourist wins. Otherwise Petr wins.\n\nIf both players play optimally, what is the probability that tourist wins the game?\n\nConstraints\n\n0 ≤ p_i, q_i ≤ 100\n\np_1 + ... + p_6 = q_1 + ... + q_6 = 100\n\nAll values in the input are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\np_1 p_2 p_3 p_4 p_5 p_6\nq_1 q_2 q_3 q_4 q_5 q_6\n\nOutput\n\nPrint the probability that tourist wins.\nThe absolute error or the relative error must be at most 10^{-9}.\n\nSample Input 1\n\n25 25 25 25 0 0\n0 0 0 0 50 50\n\nSample Output 1\n\n1.000000000000\n\ntourist can always win the game: If the number is at most 4, the color is definitely red. Otherwise the color is definitely blue.\n\nSample Input 2\n\n10 20 20 10 20 20\n20 20 20 10 10 20\n\nSample Output 2\n\n0.550000000000", "sample_input": "25 25 25 25 0 0\n0 0 0 0 50 50\n"}, "reference_outputs": ["1.000000000000\n"], "source_document_id": "p03881", "source_text": "Score : 1000 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nThere are two (6-sided) dice: a red die and a blue die.\nWhen a red die is rolled, it shows i with probability p_i percents, and when a blue die is rolled, it shows j with probability q_j percents.\n\nPetr and tourist are playing the following game.\nBoth players know the probabilistic distributions of the two dice.\nFirst, Petr chooses a die in his will (without showing it to tourist), rolls it, and tells tourist the number it shows.\nThen, tourist guesses the color of the chosen die.\nIf he guesses the color correctly, tourist wins. Otherwise Petr wins.\n\nIf both players play optimally, what is the probability that tourist wins the game?\n\nConstraints\n\n0 ≤ p_i, q_i ≤ 100\n\np_1 + ... + p_6 = q_1 + ... + q_6 = 100\n\nAll values in the input are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\np_1 p_2 p_3 p_4 p_5 p_6\nq_1 q_2 q_3 q_4 q_5 q_6\n\nOutput\n\nPrint the probability that tourist wins.\nThe absolute error or the relative error must be at most 10^{-9}.\n\nSample Input 1\n\n25 25 25 25 0 0\n0 0 0 0 50 50\n\nSample Output 1\n\n1.000000000000\n\ntourist can always win the game: If the number is at most 4, the color is definitely red. Otherwise the color is definitely blue.\n\nSample Input 2\n\n10 20 20 10 20 20\n20 20 20 10 10 20\n\nSample Output 2\n\n0.550000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s891773408", "group_id": "codeNet:p03945", "input_text": "local s=io.read()\nlocal counter=0\nfor i=1,#s-1 do\n    if s:sub(i,i)~=s:sub(i+1,i+1) then\n        counter=counter+1\n    end\nend\nprint(counter)", "language": "Lua", "metadata": {"date": 1590542847, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s891773408.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s891773408", "user_id": "u045238009"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local s=io.read()\nlocal counter=0\nfor i=1,#s-1 do\n    if s:sub(i,i)~=s:sub(i+1,i+1) then\n        counter=counter+1\n    end\nend\nprint(counter)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s068027024", "group_id": "codeNet:p03945", "input_text": "local s = io.read()\nlocal n = #s\nlocal cur = s:sub(1, 1)\nlocal cnt = 0\nfor i = 2, n do\n  if cur ~= s:sub(i, i) then\n    cnt = cnt + 1\n    cur = s:sub(i, i)\n  end\nend\nprint(cnt)\n", "language": "Lua", "metadata": {"date": 1561295342, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s068027024.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068027024", "user_id": "u120582723"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "local s = io.read()\nlocal n = #s\nlocal cur = s:sub(1, 1)\nlocal cnt = 0\nfor i = 2, n do\n  if cur ~= s:sub(i, i) then\n    cnt = cnt + 1\n    cur = s:sub(i, i)\n  end\nend\nprint(cnt)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 1008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s832660042", "group_id": "codeNet:p03945", "input_text": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478588222, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s832660042.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s832660042", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s886747017", "group_id": "codeNet:p03945", "input_text": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478588105, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s886747017.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s886747017", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 3476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s355491265", "group_id": "codeNet:p03945", "input_text": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tprint(i, \" \", t[i])\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478587979, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s355491265.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s355491265", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "s = io.read(\"*l\")\nl = string.len(s)\nt = {string.byte(s, 1, -1)} \nans = 0\nfor i = 1, l-1 do\n\tprint(i, \" \", t[i])\n\tif t[i] ~= t[i+1] then\n\t\tans = ans + 1\n\tend\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 640, "memory_kb": 8824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s812746238", "group_id": "codeNet:p03945", "input_text": "l = io.read(\"*l\")\nt = {string.byte(l, 1, -1)} \ni, ans = 1, 0\n \nfor j = 2, string.len(l) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478584029, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s812746238.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812746238", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "l = io.read(\"*l\")\nt = {string.byte(l, 1, -1)} \ni, ans = 1, 0\n \nfor j = 2, string.len(l) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 30, "memory_kb": 3476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s301071070", "group_id": "codeNet:p03945", "input_text": "l = io.read(\"*l\")\nt = {string.byte(l, 1, -1)} \ni, ans = 1, 0\n \nfor j = 2, string.len(l) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478583877, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s301071070.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s301071070", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "l = io.read(\"*l\")\nt = {string.byte(l, 1, -1)} \ni, ans = 1, 0\n \nfor j = 2, string.len(l) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s032813739", "group_id": "codeNet:p03945", "input_text": "t = {string.byte(io.read(\"*l\"), 1, -1)} \ni, ans = 1, 0\nfor j = 2, table.maxn(t) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "language": "Lua", "metadata": {"date": 1478583243, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lua/s032813739.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s032813739", "user_id": "u899855470"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "t = {string.byte(io.read(\"*l\"), 1, -1)} \ni, ans = 1, 0\nfor j = 2, table.maxn(t) do\n\tif t[i] ~= t[j] then\n\t\tans = ans + 1\n\tend\n\ti = i + 1\nend\nprint(ans)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s498462918", "group_id": "codeNet:p04044", "input_text": "local n, l = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = io.read()\nend\ntable.sort(t)\nprint(table.concat(t))\n", "language": "Lua", "metadata": {"date": 1594178669, "filename_ext": "lua", "original_language": "Lua (Lua 5.3.5)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lua/s498462918.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498462918", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "local n, l = io.read(\"*n\", \"*n\", \"*l\")\nlocal t = {}\nfor i = 1, n do\n  t[i] = io.read()\nend\ntable.sort(t)\nprint(table.concat(t))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 5, "memory_kb": 2664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s148488595", "group_id": "codeNet:p04044", "input_text": "local read = io.read\nlocal byte = string.byte\nlocal N, L = read(\"*n\", \"*n\")\nread(\"*l\")\nlocal S = {}\nfor i = 1, N do\n\tlocal str = read(\"*l\")\n\tS[i] = {byte(str, 1, L)}\n\tsetmetatable(S[i], {__call = function() return str end})\nend\n\nlocal function isDict(s1, s2)\n\tfor i = 1, L do\n\t\tif s1[i] < s2[i] then\n\t\t\treturn true\n\t\telseif s1[i] > s2[i] then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn false\nend\n\ntable.sort(S, isDict)\nlocal out = \"\"\nfor i = 1, N do\n\tout = out..S[i]()\nend\n\nprint(out)\n", "language": "Lua", "metadata": {"date": 1591578149, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lua/s148488595.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s148488595", "user_id": "u793881115"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "local read = io.read\nlocal byte = string.byte\nlocal N, L = read(\"*n\", \"*n\")\nread(\"*l\")\nlocal S = {}\nfor i = 1, N do\n\tlocal str = read(\"*l\")\n\tS[i] = {byte(str, 1, L)}\n\tsetmetatable(S[i], {__call = function() return str end})\nend\n\nlocal function isDict(s1, s2)\n\tfor i = 1, L do\n\t\tif s1[i] < s2[i] then\n\t\t\treturn true\n\t\telseif s1[i] > s2[i] then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn false\nend\n\ntable.sort(S, isDict)\nlocal out = \"\"\nfor i = 1, N do\n\tout = out..S[i]()\nend\n\nprint(out)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 477, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s019517525", "group_id": "codeNet:p04044", "input_text": "n,l=io.read(\"*n\",\"*n\",\"*l\")\ns={}\nfor i=1,n do\n    table.insert(s,io.read())\nend\ntable.sort(s)\nanswer=table.concat(s,\"\")\nprint(answer)", "language": "Lua", "metadata": {"date": 1587499141, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lua/s019517525.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s019517525", "user_id": "u045238009"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "n,l=io.read(\"*n\",\"*n\",\"*l\")\ns={}\nfor i=1,n do\n    table.insert(s,io.read())\nend\ntable.sort(s)\nanswer=table.concat(s,\"\")\nprint(answer)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s127006178", "group_id": "codeNet:p04044", "input_text": "N,L=io.read(\"n\",\"n\",\"l\")\nS={}\nfor i=1,N do S[i]=io.read() end\ntable.sort(S)\nprint(table.concat(S,\"\"))", "language": "Lua", "metadata": {"date": 1568780488, "filename_ext": "lua", "original_language": "Lua (5.3.2)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lua/s127006178.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127006178", "user_id": "u162773977"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "N,L=io.read(\"n\",\"n\",\"l\")\nS={}\nfor i=1,N do S[i]=io.read() end\ntable.sort(S)\nprint(table.concat(S,\"\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lua:s652552219", "group_id": "codeNet:p04044", "input_text": "a,b= io.read(\"*n\", \"*n\", \"*l\")\ns ={}\nfor i = 1, a do\n  s[i] = io.read()\nend\ntable.sort(s)\nfor i = 1, a do\n  io.write(s[i])\nend\nio.write(\"\\n\")\n", "language": "Lua", "metadata": {"date": 1555040218, "filename_ext": "lua", "original_language": "LuaJIT (2.0.4)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lua/s652552219.lua", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652552219", "user_id": "u120582723"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "a,b= io.read(\"*n\", \"*n\", \"*l\")\ns ={}\nfor i = 1, a do\n  s[i] = io.read()\nend\ntable.sort(s)\nfor i = 1, a do\n  io.write(s[i])\nend\nio.write(\"\\n\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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"}